login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A025162
Number of partitions of n with distinct parts p(i) such that if i != j, then |p(i) - p(j)| >= 8.
7
1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 11, 12, 13, 15, 16, 18, 20, 22, 24, 27, 29, 32, 35, 38, 41, 45, 48, 52, 56, 60, 64, 69, 73, 78, 83, 89, 94, 101, 107, 115, 122, 131, 139, 150, 159, 171, 182, 196, 208, 224, 238, 256, 272, 292, 310
OFFSET
1,10
LINKS
FORMULA
G.f.: Sum(x^(4*k^2-3*k)/Product(1-x^i, i=1..k), k=1..infinity). - Vladeta Jovovic, Aug 12 2004
CROSSREFS
Column k=8 of A194543.
Sequence in context: A330015 A331163 A157271 * A330027 A373074 A248180
KEYWORD
nonn
EXTENSIONS
More terms from Naohiro Nomoto, Feb 27 2002
STATUS
approved