cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A007576 Number of solutions to k_1 + 2*k_2 + ... + n*k_n = 0, where k_i are from {-1,0,1}, i=1..n.

Original entry on oeis.org

1, 1, 1, 3, 7, 15, 35, 87, 217, 547, 1417, 3735, 9911, 26513, 71581, 194681, 532481, 1464029, 4045117, 11225159, 31268577, 87404465, 245101771, 689323849, 1943817227, 5494808425, 15568077235, 44200775239, 125739619467
Offset: 0

Views

Author

Keywords

Comments

Also, number of maximally stable towers of 2 X 2 LEGO blocks.

Examples

			For n=4 there are 7 solutions: (-1,-1,1,0), (-1,0,-1,1), (-1,1,1,-1), (0,0,0,0), (1,-1,-1,1), (1,0,1,-1), (1,1,-1,0).
		

References

  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
  • P. J. S. Watson, On "LEGO" towers, J. Rec. Math., 12 (No. 1, 1979-1980), 24-27.

Crossrefs

Programs

  • Mathematica
    f[0] = 1; f[n_] := Coefficient[Expand@ Product[1 + x^k + x^(2k), {k, n}], x^(n(n + 1)/2)]; Table[f@n, {n, 0, 28}] (* Robert G. Wilson v, Nov 10 2006 *)
  • Maxima
    a(n):=coeff(expand(product(1+x^k+x^(2*k),k,1,n)),x,binomial(n+1,2));
    makelist(a(n),n,0,24);

Formula

Coefficient of x^(n*(n+1)/2) in Product_{k=1..n} (1+x^k+x^(2*k)).
Equivalently, the coefficient of x^0 in Product_{k=1..n} (1/x^k + 1 + x^k). - Paul D. Hanna, Jul 10 2018
a(n) ~ 3^(n + 1) / (2 * sqrt(Pi) * n^(3/2)). - Vaclav Kotesovec, Jul 11 2018
a(n) = (1/(2*Pi))*Integral_{t=0..2*Pi} ( Product_{k=1..n} (1+2*cos(k*t)) ) dt. - Ovidiu Bagdasar, Aug 08 2018

Extensions

More terms from David Wasserman, Mar 29 2005
Edited by N. J. A. Sloane, Nov 07 2006. This is a merging of two sequences which, thanks to the work of Søren Eilers, we now know are identical.