login
This site is supported by donations to The OEIS Foundation.

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A090631 Given n boxes labeled 1..n, such that box i weighs 2i grams and can support a total weight of i grams; a(n) = number of stacks of boxes that can be formed such that no box is squashed. 3

%I

%S 1,2,4,6,9,12,17,22,29,36,45,54,66,78,93,108,126,144,167,190,218,246,

%T 279,312,352,392,439,486,540,594,657,720,792,864,945,1026,1119,1212,

%U 1317,1422,1539,1656,1788,1920,2067,2214,2376,2538,2718,2898,3096,3294

%N Given n boxes labeled 1..n, such that box i weighs 2i grams and can support a total weight of i grams; a(n) = number of stacks of boxes that can be formed such that no box is squashed.

%D Rodseth, Oystein J., Sloane's box stacking problem. Discrete Math. 306 (2006), no. 16, 2005-2009.

%H N. J. A. Sloane and J. A. Sellers, <a href="http://arXiv.org/abs/math.CO/0312418">On non-squashing partitions</a>, Discrete Math., 294 (2005), 259-274.

%F Generating function: 1/(1-q)^2/product((1-q^(2*3^i)), i=0..infinity) - _James A. Sellers_, Dec 23 2005

%e For n=4 the a(4) = 9 possible stacks are: empty, 1, 2, 3, 4, 12, 13, 14, 24.

%p 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: (Sellers)

%Y Cf. A089054, A090632.

%K nonn

%O 0,2

%A _N. J. A. Sloane_, Dec 13 2003

%E More terms from _James A. Sellers_, Dec 23 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified September 30 16:06 EDT 2014. Contains 247460 sequences.