|
Search: id:A090641
|
|
|
| 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. |
|
+0
2
|
|
| 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, 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, 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
(list; table; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
COMMENT
|
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.
|
|
LINKS
|
N. J. A. Sloane and J. A. Sellers, On non-squashing partitions, Discrete Math., 294 (2005), 259-274.
|
|
EXAMPLE
|
Triangle begins:
1
1 1
1 2 1
1 3 3 1
1 4 6 3 0
1 5 10 7 0 0
|
|
CROSSREFS
|
Row sums of A089054. Columns give A000217, etc.
Sequence in context: A046688 A157283 A067049 this_sequence A055216 A128629 A107065
Adjacent sequences: A090638 A090639 A090640 this_sequence A090642 A090643 A090644
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Dec 14 2003
|
|
|
Search completed in 0.002 seconds
|
