id:A026826 - OEIS Search Results

Search: id:A026826

Displaying 1-1 of 1 results found.

page 1

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

+0
3

0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 7, 7, 9, 10, 12, 13, 16, 17, 20, 23, 26, 29, 34, 38, 43, 49, 55, 62, 70, 79, 88, 100, 111, 125, 140, 157, 174, 196, 217, 243, 270, 301, 333, 372, 411, 457, 506, 561, 619, 687, 757, 837, 924, 1019, 1122 (list; graph; listen)

	OFFSET	`0,19`
	FORMULA	`a(n)=A025151(n-5), n>5. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008` `G.f.: x^5*product_{j=6..infinity} (1+x^j). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008`
	CROSSREFS	`Cf. A025147.` `Cf. A025147.` `Sequence in context: A026802 A029031 A029156 this_sequence A025151 A026801 A027191` `Adjacent sequences: A026823 A026824 A026825 this_sequence A026827 A026828 A026829`
	KEYWORD	`nonn,easy`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.

AT&T Labs Research