id:A025153 - OEIS Search Results

Search: id:A025153

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n into distinct parts >= 8.

+0
3

1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 8, 8, 10, 11, 13, 14, 17, 18, 21, 23, 26, 29, 33, 36, 41, 46, 51, 57, 64, 71, 79, 88, 97, 109, 120, 133, 147, 164, 180, 200, 220, 244, 268, 297, 325, 360, 395, 435, 477, 526, 575, 633, 693, 761, 832, 913 (list; graph; listen)

	OFFSET	`0,18`
	FORMULA	`a(n)=A026828(n+7). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008` `G.f.: product_{j=8..infinity} (1+x^j). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008`
	CROSSREFS	`Cf. A025147.` `Cf. A025147.` `Sequence in context: A025154 A096401 A026828 this_sequence A026803 A027192 A025766` `Adjacent sequences: A025150 A025151 A025152 this_sequence A025154 A025155 A025156`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.

AT&T Labs Research