id:A025155 - OEIS Search Results

Search: id:A025155

Displaying 1-1 of 1 results found.

page 1

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

+0
4

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, 427, 464, 508, 553 (list; graph; listen)

	OFFSET	`0,22`
	FORMULA	`a(n)=A026830(n+9). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008` `G.f.: product_{j=10..infinity} (1+x^j). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008`
	EXAMPLE	`Say n = 11. Then there is one and only one partition of n into distinct parts each of which is >= 10, namely 11 = 11. Hence a(11) = 1.`
	CROSSREFS	`Cf. A026831.` `Cf. A025147.` `Cf. A025147.` `Sequence in context: A026831 A096740 A026830 this_sequence A111684 A025159 A026829` `Adjacent sequences: A025152 A025153 A025154 this_sequence A025156 A025157 A025158`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.

AT&T Labs Research