|
Search: id:A089054
|
|
|
| A089054 |
|
Solution to the non-squashing boxes problem (version 1). |
|
+0
7
|
|
| 1, 2, 4, 8, 14, 23, 36, 54, 78, 109, 149, 199, 262, 339, 434, 548, 686, 849, 1043, 1269, 1535, 1842, 2199, 2607, 3078, 3613, 4225, 4915, 5700, 6581, 7576, 8686, 9934, 11321, 12871, 14585, 16493, 18596, 20925, 23481, 26303, 29392, 32788, 36492, 40553, 44972, 49799
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Given n boxes labeled 1..n, such that box i weighs i 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.
|
|
LINKS
|
N. J. A. Sloane and J. A. Sellers, On non-squashing partitions, Discrete Math., 294 (2005), 259-274.
|
|
FORMULA
|
G.f.: (B(x)-x)/(1-x)^2, where B(x) = g.f. for A088567.
|
|
CROSSREFS
|
Cf. A000123, A088567, A089055, A090631, A090632. Row sums of A090641.
Sequence in context: A087151 A053798 A138526 this_sequence A055291 A091773 A107055
Adjacent sequences: A089051 A089052 A089053 this_sequence A089055 A089056 A089057
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Dec 04 2003
|
|
|
Search completed in 0.002 seconds
|
