id:A026829 - OEIS Search Results

Search: id:A026829

Displaying 1-1 of 1 results found.

page 1

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

+0
3

0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 8, 9, 10, 12, 13, 15, 17, 19, 21, 24, 26, 29, 33, 36, 40, 45, 50, 55, 62, 68, 76, 84, 93, 102, 114, 125, 138, 152, 168, 184, 204, 223, 246, 270, 297, 325, 358, 391, 429, 470 (list; graph; listen)

	OFFSET	`0,28`
	FORMULA	`a(n)=A025154(n-8), n>8. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008` `G.f.: x^8*product_{j=9..infinity} (1+x^j). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008`
	CROSSREFS	`Cf. A025147.` `Cf. A025147.` `Sequence in context: A025155 A111684 A025159 this_sequence A025154 A096401 A026828` `Adjacent sequences: A026826 A026827 A026828 this_sequence A026830 A026831 A026832`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research