id:A089055 - OEIS Search Results

Search: id:A089055

Displaying 1-1 of 1 results found.

page 1

Solution to the non-squashing boxes problem (version 2).

+0
3

2, 4, 8, 16, 28, 46, 72, 108, 156, 218, 298, 398, 524, 678, 868, 1096, 1372, 1698, 2086, 2538, 3070, 3684, 4398, 5214, 6156, 7226, 8450, 9830, 11400, 13162, 15152, 17372, 19868, 22642, 25742, 29170, 32986, 37192, 41850, 46962, 52606, 58784, 65576, 72984, 81106 (list; graph; listen)

	OFFSET	`0,1`
	COMMENT	`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.`
	LINKS	`N. J. A. Sloane and J. A. Sellers, On non-squashing partitions, Discrete Math., 294 (2005), 259-274.`
	FORMULA	`See A089054 for g.f.`
	CROSSREFS	`Cf. A000123, A088567. Equals 2*A089054. Row sums of A089239.` `Sequence in context: A018826 A104899 A057975 this_sequence A112128 A054189 A127195` `Adjacent sequences: A089052 A089053 A089054 this_sequence A089056 A089057 A089058`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Dec 04 2003`

page 1

Search completed in 0.002 seconds

Last modified December 10 00:48 EST 2009. Contains 170565 sequences.

AT&T Labs Research