|
%I #13 Nov 04 2020 06:15:13
%S 2,4,8,16,28,46,72,108,156,218,298,398,524,678,868,1096,1372,1698,
%T 2086,2538,3070,3684,4398,5214,6156,7226,8450,9830,11400,13162,15152,
%U 17372,19868,22642,25742,29170,32986,37192,41850,46962,52606,58784,65576,72984,81106
%N Solution to the non-squashing boxes problem (version 2).
%C Given n+1 boxes labeled 0..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.
%H Amanda Folsom, Youkow Homma, Jun Hwan Ryu, and Benjamin Tong, <a href="https://doi.org/10.1016/j.disc.2015.12.019">On a general class of non-squashing partitions</a>, Discrete Mathematics 339 (2016) 1482-1506.
%H N. J. A. Sloane and J. A. Sellers, <a href="https://arxiv.org/abs/math/0312418">On non-squashing partitions</a>, arXiv:math/0312418 [math.CO], 2003; Discrete Math., 294 (2005), 259-274.
%F See A089054 for g.f.
%Y Cf. A000123, A088567. Equals 2*A089054. Row sums of A089239.
%K nonn
%O 0,1
%A _N. J. A. Sloane_, Dec 04 2003
|
