The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A218509 Number of partitions of n in which any two parts differ by at most 7. 4

%I

%S 1,1,2,3,5,7,11,15,22,30,41,54,72,93,120,153,194,242,302,372,457,556,

%T 675,812,975,1162,1381,1632,1923,2254,2636,3068,3562,4119,4752,5462,

%U 6265,7162,8170,9293,10549,11942,13495,15211,17115,19214,21534,24083,26892

%N Number of partitions of n in which any two parts differ by at most 7.

%H Alois P. Heinz, <a href="/A218509/b218509.txt">Table of n, a(n) for n = 0..1000</a>

%F G.f.: 1 + Sum_{j>0} x^j / Product_{i=0..7} (1-x^(i+j)).

%p b:= proc(n, i, k) option remember; `if`(n<0 or k<0, 0,

%p `if`(n=0, 1, `if`(i<1, 0, b(n, i-1, k-1) +b(n-i, i, k))))

%p end:

%p a:= n-> `if`(n=0, 1, 0) +add(b(n-i, i, 7), i=1..n):

%p seq(a(n), n=0..80);

%t b[n_, i_, k_] := b[n, i, k] = If[n < 0 || k < 0, 0, If[n == 0, 1, If[i < 1, 0, b[n, i - 1, k - 1] + b[n - i, i, k]]]];

%t a[n_] := If[n == 0, 1, 0] + Sum[b[n - i, i, 7], {i, 1, n}];

%t Table[a[n], {n, 0, 80}] (* _Jean-François Alcover_, May 20 2018, after _Alois P. Heinz_ *)

%Y Column k=7 of A194621.

%K nonn

%O 0,3

%A _Alois P. Heinz_, Oct 31 2012

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.

Last modified June 25 05:58 EDT 2021. Contains 345452 sequences. (Running on oeis4.)