cp's OEIS Frontend

A218703 Number of partitions of n in which any two distinct parts differ by at least 8.

%I A218703 #12 Jan 29 2022 04:14:57
%S A218703 1,1,2,2,3,2,4,2,4,3,5,4,10,7,12,13,17,16,23,21,30,30,34,35,47,43,51,
%T A218703 52,66,63,81,77,100,99,120,121,156,150,185,189,234,230,283,281,343,
%U A218703 350,409,414,503,497,587,600,695,703,824,830,967,988,1122,1148,1333
%N A218703 Number of partitions of n in which any two distinct parts differ by at least 8.
%C A218703 Also number of partitions of n in which each part, with the possible exception of the largest, occurs at least 8 times.
%H A218703 Vaclav Kotesovec, <a href="/A218703/b218703.txt">Table of n, a(n) for n = 0..10000</a> (terms 0..1000 from Alois P. Heinz)
%F A218703 G.f.: 1 + Sum_{j>=1} x^j/(1-x^j) * Product_{i=1..j-1} (1+x^(8*i)/(1-x^i)).
%F A218703 log(a(n)) ~ sqrt((2*Pi^2/3 + 4*c)*n), where c = Integral_{0..infinity} log(1 - exp(-x) + exp(-8*x)) dx = -1.1447921975208768146551512630331558734964408879... - _Vaclav Kotesovec_, Jan 28 2022
%e A218703 a(9) = 3: [1,1,1,1,1,1,1,1,1], [3,3,3], [9].
%e A218703 a(10) = 5: [1,1,1,1,1,1,1,1,1,1], [2,2,2,2,2], [5,5], [1,9], [10].
%e A218703 a(11) = 4: [1,1,1,1,1,1,1,1,1,1,1], [1,1,9], [1,10], [11].
%p A218703 b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,
%p A218703        b(n, i-1) +add(b(n-i*j, i-8), j=1..n/i)))
%p A218703     end:
%p A218703 a:= n-> b(n, n):
%p A218703 seq(a(n), n=0..70);
%Y A218703 Column k=8 of A218698.
%Y A218703 Cf. A160978.
%K A218703 nonn
%O A218703 0,3
%A A218703 _Alois P. Heinz_, Nov 04 2012