A026830 - OEIS

This site is supported by donations to The OEIS Foundation.

A026830

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

0, 0, 0, 0, 0, 0, 0, 0, 0, 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 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,31`
	FORMULA	`a(n)=A025155(n-9), n>9. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008` `G.f.: x^9*product_{j=10..infinity} (1+x^j). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008`
	CROSSREFS	`Cf. A025147.` `Cf. A025147.` `Sequence in context: A025160 A026831 A096740 * A025155 A111684 A025159` `Adjacent sequences: A026827 A026828 A026829 * A026831 A026832 A026833`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

Content is available under The OEIS End-User License Agreement .

Last modified February 17 13:28 EST 2012. Contains 206031 sequences.