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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,10

LINKS

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

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

Cf. A003114, A025157-A025162.

Column k=8 of A194543.

Sequence in context: A110654 A109728 A157271 * A248180 A025161 A021895

Adjacent sequences:  A025159 A025160 A025161 * A025163 A025164 A025165

KEYWORD

nonn

AUTHOR

Clark Kimberling

EXTENSIONS

More terms from Naohiro Nomoto, Feb 27 2002

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 May 22 21:40 EDT 2017. Contains 286906 sequences.