id:A026828 - OEIS Search Results

Search: id:A026828

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n into distinct parts, the least being 7.

+0
3

0, 0, 0, 0, 0, 0, 0, 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 (list; graph; listen)

	OFFSET	`0,25`
	FORMULA	`a(n)=A025153(n-7), n>7. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008` `G.f.: x^7*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: A026829 A025154 A096401 this_sequence A025153 A026803 A027192` `Adjacent sequences: A026825 A026826 A026827 this_sequence A026829 A026830 A026831`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified December 19 12:50 EST 2009. Contains 171053 sequences.

AT&T Labs Research