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!)
A218571 Number of partitions p of n such that max(p)-min(p) = 8. 3
1, 1, 3, 3, 7, 8, 14, 18, 28, 35, 52, 65, 90, 113, 152, 188, 246, 302, 387, 471, 591, 714, 884, 1059, 1292, 1538, 1857, 2193, 2621, 3077, 3646, 4254, 4999, 5801, 6772, 7815, 9062, 10409, 12002, 13719, 15733, 17909, 20438, 23169, 26318, 29722, 33623, 37833 (list; graph; refs; listen; history; text; internal format)
OFFSET
10,3
LINKS
G. E. Andrews, M. Beck and N. Robbins, Partitions with fixed differences between largest and smallest parts, arXiv:1406.3374 [math.NT], 2014.
FORMULA
G.f.: Sum_{k>0} x^(2*k+8)/Product_{j=0..8} (1-x^(k+j)).
a(n) = A097364(n,8) = A116685(n,8) = A194621(n,8) - A194621(n,7) = A218510(n) - A218509(n).
MATHEMATICA
terms = 48; offset = 10; max = terms + offset; s[k0_ /; k0 > 0] := Sum[x^(2*k + k0)/Product[ (1 - x^(k + j)), {j, 0, k0}], {k, 1, Ceiling[max/2]}] + O[x]^max // CoefficientList[#, x] &; Drop[s[8], offset] (* Jean-François Alcover, Sep 11 2017, after Alois P. Heinz *)
CROSSREFS
Sequence in context: A218568 A218569 A218570 * A218572 A218573 A117989
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Nov 02 2012
STATUS
approved

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 23 23:26 EDT 2024. Contains 371917 sequences. (Running on oeis4.)