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!)
A218568 Number of partitions p of n such that max(p)-min(p) = 5. 3

%I #11 Jul 19 2017 20:18:27

%S 1,1,3,3,7,8,14,17,26,31,45,54,73,87,114,135,171,200,249,290,352,406,

%T 487,560,660,752,879,997,1153,1298,1489,1671,1900,2121,2397,2665,2992,

%U 3311,3701,4081,4535,4982,5514,6042,6655,7265,7977,8686,9502,10314,11248

%N Number of partitions p of n such that max(p)-min(p) = 5.

%H Alois P. Heinz, <a href="/A218568/b218568.txt">Table of n, a(n) for n = 7..1000</a>

%H G. E. Andrews, M. Beck and N. Robbins, <a href="https://arxiv.org/abs/1406.3374">Partitions with fixed differences between largest and smallest parts</a>, arXiv:1406.3374 [math.NT], 2014

%F G.f.: Sum_{k>0} x^(2*k+5)/Product_{j=0..5} (1-x^(k+j)).

%F a(n) = A097364(n,5) = A116685(n,5) = A194621(n,5) - A194621(n,4) = A218507(n) - A218506(n).

%t Table[Count[IntegerPartitions[n],_?(Max[#]-Min[#]==5&)],{n,7,60}] (* _Harvey P. Dale_, Sep 25 2015 *)

%K nonn

%O 7,3

%A _Alois P. Heinz_, Nov 02 2012

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 August 1 08:32 EDT 2024. Contains 374811 sequences. (Running on oeis4.)