id:A026827 - OEIS Search Results

Search: id:A026827

Displaying 1-1 of 1 results found.

page 1

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

+0
3

0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 7, 8, 9, 11, 12, 14, 16, 18, 20, 23, 26, 29, 33, 37, 42, 47, 53, 59, 67, 74, 83, 93, 104, 115, 129, 143, 160, 177, 197, 218, 243, 268, 297, 329, 364, 401, 444, 489, 540, 595, 655, 721, 794, 872, 958 (list; graph; listen)

	OFFSET	`0,22`
	FORMULA	`a(n)=A025152(n-6), n>6. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008` `G.f.: x^6*product_{j=7..infinity} (1+x^j). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008`
	CROSSREFS	`Cf. A025147.` `Cf. A025147.` `Sequence in context: A027192 A025766 A025158 this_sequence A025152 A026802 A029031` `Adjacent sequences: A026824 A026825 A026826 this_sequence A026828 A026829 A026830`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified December 7 08:40 EST 2009. Contains 170430 sequences.

AT&T Labs Research