made with Mathematica technology MathWorld

Nonassociative Product

The number of nonassociative n-products with k elements preceding the rightmost left parameter is

F(n,k)=F(n-1,k)+F(n-1,k-1)
(1)
=(n+k-2; k)-(n+k-1; k-1),
(2)

where (n; k) is a binomial coefficient. The number of n-products in a nonassociative algebra is

 F(n)=C_n=sum_(j=0)^(n-2)F(n,j)=((2n-2)!)/(n!(n-1)!),
(3)

where C_n is a Catalan number, 1, 1, 2, 5, 14, 42, 132, ... (Sloane's A000108).

REFERENCES:

Niven, I. M. Mathematics of Choice: Or, How to Count Without Counting. Washington, DC: Math. Assoc. Amer., pp. 140-152, 1965.

Sloane, N. J. A. Sequence A000108/M1459 in "The On-Line Encyclopedia of Integer Sequences."




CITE THIS AS:

Weisstein, Eric W. "Nonassociative Product." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/NonassociativeProduct.html

The Wolfram Demonstrations Project Browse Topics View Latest
JUST RELEASED: Wolfram Mathematica 7