proposed
approved
proposed
approved
editing
proposed
Rodseth, Oystein J., Sloane's box stacking problem. Discrete Math. 306 (2006), no. 16, 2005-2009.
Oystein J. Rodseth, <a href="https://doi.org/10.1016/j.disc.2006.03.051">Sloane's box stacking problem</a>, Discrete Math. 306 (2006), no. 16, 2005-2009.
N. J. A. Sloane and J. A. Sellers, <a href="httphttps://arXivdoi.org/abs/math10.CO1016/0312418j
proposed
editing
editing
proposed
Generating functionG.f.: 1/(1-q)^2/product(Product_{i>=0} (1 - q^(2*3^i)), i=0..infinity) - James A. Sellers, Dec 23 2005
For n=4 the The a(4) = 9 possible stacks are: empty, 1, 2, 3, 4, 12, 13, 14, 24.
p:=1/(1-q)^2/product((1-q^(2*3^i)), i=0..5): s:=series(p, q, 100): for n from 0 to 99 do printf(`%d, `, coeff(s, q, n)) od: (# _James A. Sellers)_, Dec 23 2005
approved
editing
Generating function: 1/(1-q)^2/product((1-q^(2*3^i)), i=0..infinity) - _James A. Sellers (sellersj(AT)math.psu.edu), _, Dec 23 2005
More terms from _James A. Sellers (sellersj(AT)math.psu.edu), _, Dec 23 2005
_N. J. A. Sloane (njas(AT)research.att.com), _, Dec 13 2003
editing
approved
Rodseth, Oystein J., Sloane's box stacking problem. Discrete Math. 306 (2006), no. 16, 2005-2009.
approved
editing