id:A026825 - OEIS Search Results

Search: id:A026825

Displaying 1-1 of 1 results found.

page 1

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

+0
3

0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 6, 7, 8, 10, 11, 13, 15, 17, 20, 23, 26, 30, 35, 39, 45, 51, 58, 66, 75, 84, 96, 108, 122, 137, 155, 173, 195, 219, 245, 274, 307, 342, 383, 427, 475, 529, 589, 654, 727, 807, 894, 991, 1098, 1214, 1343, 1485, 1638, 1809 (list; graph; listen)

	OFFSET	`0,16`
	FORMULA	`a(n)=A025150(n-4), n>4. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008` `G.f.: x^4*product_{j=5..infinity} (1+x^j). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008`
	CROSSREFS	`Cf. A025147.` `Cf. A025147.` `Sequence in context: A029029 A025157 A006141 this_sequence A025150 A026800 A029028` `Adjacent sequences: A026822 A026823 A026824 this_sequence A026826 A026827 A026828`
	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