id:A025151 - OEIS Search Results

Search: id:A025151

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n into distinct parts >= 6.

+0
3

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, 1238, 1361, 1498 (list; graph; listen)

	OFFSET	`0,14`
	FORMULA	`a(n)=A026826(n+5). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008` `G.f.: 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: A029031 A029156 A026826 this_sequence A026801 A027191 A122522` `Adjacent sequences: A025148 A025149 A025150 this_sequence A025152 A025153 A025154`
	KEYWORD	`nonn,easy`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified December 4 08:03 EST 2009. Contains 170310 sequences.

AT&T Labs Research