login
The OEIS is supported by the many generous donors 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

%I #11 May 10 2013 12:44:04

%S 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,

%T 18,20,22,24,27,29,32,35,38,41,45,48,52,56,60,64,69,73,78,83,89,94,

%U 101,107,115,122,131,139,150,159,171,182,196,208,224,238,256,272,292,310

%N Number of partitions of n with distinct parts p(i) such that if i != j, then |p(i) - p(j)| >= 8.

%H Alois P. Heinz, <a href="/A025162/b025162.txt">Table of n, a(n) for n = 1..1000</a>

%F G.f.: Sum(x^(4*k^2-3*k)/Product(1-x^i, i=1..k), k=1..infinity). - _Vladeta Jovovic_, Aug 12 2004

%Y Cf. A003114, A025157-A025162.

%Y Column k=8 of A194543.

%K nonn

%O 1,10

%A _Clark Kimberling_

%E More terms from _Naohiro Nomoto_, Feb 27 2002

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 14:32 EDT 2024. Contains 371960 sequences. (Running on oeis4.)