A026826 - OEIS

This site is supported by donations to The OEIS Foundation.

A026826

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

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; refs; listen; history; internal format)

	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: A029031 A188666 A029156 * A025151 A026801 A185328` `Adjacent sequences: A026823 A026824 A026825 * A026827 A026828 A026829`
	KEYWORD	`nonn,easy`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

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

Last modified February 17 12:38 EST 2012. Contains 206021 sequences.