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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A218573 Number of partitions p of n such that max(p)-min(p) = 10. 4
1, 1, 3, 3, 7, 8, 14, 18, 28, 35, 53, 67, 93, 119, 161, 201, 267, 332, 428, 531, 674, 824, 1034, 1258, 1552, 1877, 2294, 2749, 3332, 3970, 4762, 5645, 6723, 7916, 9367, 10974, 12894, 15036, 17571, 20381, 23696, 27370, 31652, 36416, 41926, 48029, 55071, 62860 (list; graph; refs; listen; history; text; internal format)
OFFSET

12,3

LINKS

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

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+10)/Product_{j=0..10} (1-x^(k+j)).

a(n) = A097364(n,10) = A116685(n,10) = A194621(n,10) - A194621(n,9) = A218512(n) - A218511(n).

MATHEMATICA

terms = 48; offset = 12; 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[10], offset] (* Jean-Fran├žois Alcover, Sep 11 2017, after Alois P. Heinz *)

CROSSREFS

Sequence in context: A218570 A218571 A218572 * A117989 A241642 A086543

Adjacent sequences:  A218570 A218571 A218572 * A218574 A218575 A218576

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 15 21:35 EST 2019. Contains 329160 sequences. (Running on oeis4.)