login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025160 Number of partitions of n with distinct parts p(i) such that if i != j, then |p(i) - p(j)| >= 6. 3
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, 39, 43, 46, 50, 54, 59, 63, 69, 74, 81, 87, 95, 102, 112, 120, 131, 141, 154, 165, 180, 193, 210, 225, 244, 261, 283, 302, 326, 348, 375, 400, 430, 458, 492 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,8

LINKS

Alois P. Heinz, Table of n, a(n) for n = 1..1000

FORMULA

G.f.: Sum(x^(3*k^2-2*k)/Product(1-x^i, i=1..k), k=1..infinity). - Vladeta Jovovic, Aug 12 2004

CROSSREFS

Cf. A003114, A025157-A025162.

Column k=6 of A194543.

Sequence in context: A248180 A025161 A021895 * A026831 A096740 A264595

Adjacent sequences:  A025157 A025158 A025159 * A025161 A025162 A025163

KEYWORD

nonn

AUTHOR

Clark Kimberling

EXTENSIONS

More terms from Vladeta Jovovic, Aug 12 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified August 23 06:19 EDT 2017. Contains 290958 sequences.