The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A090641 Triangle read by rows: T(n,k) (n >= 0, 0 <= k <= n) giving number of solutions to the n-box stacking problem in which exactly k boxes are used in the stack. 1

%I #5 Mar 30 2012 16:49:51

%S 1,1,1,1,2,1,1,3,3,1,1,4,6,3,0,1,5,10,7,0,0,1,6,15,13,1,0,0,1,7,21,22,

%T 3,0,0,0,1,8,28,34,7,0,0,0,0,1,9,36,50,13,0,0,0,0,0,1,10,45,70,23,0,0,

%U 0,0,0,0,1,11,55,95,37,0,0,0,0,0,0,0,1,12,66,125,57,1,0,0,0

%N Triangle read by rows: T(n,k) (n >= 0, 0 <= k <= n) giving number of solutions to the n-box stacking problem in which exactly k boxes are used in the stack.

%C Given n boxes labeled 1..n, such that box i weighs i grams and can support a total weight of i grams, T(n,k) = number of ways to form a stack of boxes such that no box is squashed.

%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.

%e Triangle begins:

%e 1

%e 1 1

%e 1 2 1

%e 1 3 3 1

%e 1 4 6 3 0

%e 1 5 10 7 0 0

%Y Row sums of A089054. Columns give A000217, etc.

%K nonn,tabl

%O 0,5

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

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

Last modified April 12 10:51 EDT 2024. Contains 371632 sequences. (Running on oeis4.)