id:A096740 - OEIS Search Results

Search: id:A096740

Displaying 1-1 of 1 results found.

page 1

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

+0
3

1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 9, 10, 11, 13, 14, 16, 18, 20, 22, 25, 27, 30, 33, 36, 40, 44, 48, 53, 59, 64, 71, 78, 86, 94, 104, 113, 125, 136, 149, 163, 179, 194, 213, 232, 254, 276, 302, 328, 359, 390, 425 (list; graph; listen)

	OFFSET	`0,24`
	COMMENT	`The old entry with this sequence number was a duplicate of A071569.`
	FORMULA	`a(n)=A026831(n+10). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008` `G.f.: product_{j=11..infinity} (1+x^j). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008` `a(n)=A026831(n+10). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 30 2008]`
	CROSSREFS	`Cf. A025147.` `Cf. A025147.` `Sequence in context: A021895 A025160 A026831 this_sequence A026830 A025155 A111684` `Adjacent sequences: A096737 A096738 A096739 this_sequence A096741 A096742 A096743`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Sep 28 2008`

page 1

Search completed in 0.002 seconds

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.

AT&T Labs Research