id:A026830 - OEIS Search Results

Search: id:A026830

Displaying 1-1 of 1 results found.

page 1

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

+0
3

0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 9, 9, 11, 12, 14, 15, 18, 19, 22, 24, 27, 29, 33, 36, 40, 44, 49, 54, 60, 66, 73, 81, 89, 98, 108, 119, 130, 144, 157, 173, 189, 208, 227, 250, 272, 299, 326, 358, 389 (list; graph; listen)

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

page 1

Search completed in 0.005 seconds

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

AT&T Labs Research