cp's OEIS Frontend

A245038 Number of partitions of n where the minimal multiplicity of any part is 7.

%I A245038 #7 May 01 2018 04:10:09
%S A245038 1,0,0,0,0,0,0,1,0,0,0,0,0,0,2,1,2,1,2,1,2,3,3,2,4,2,3,3,6,3,6,4,6,4,
%T A245038 6,7,9,8,9,11,14,11,19,17,20,21,25,24,31,32,36,37,44,40,52,52,65,58,
%U A245038 70,69,83,78,93,99,111,104,126,124,142,141,177,167,201
%N A245038 Number of partitions of n where the minimal multiplicity of any part is 7.
%H A245038 Joerg Arndt and Alois P. Heinz, <a href="/A245038/b245038.txt">Table of n, a(n) for n = 7..1000</a>
%p A245038 b:= proc(n, i, k) option remember; `if`(n=0, 1, `if`(i<1, 0,
%p A245038       b(n, i-1, k) +add(b(n-i*j, i-1, k), j=max(1, k)..n/i)))
%p A245038     end:
%p A245038 a:= n-> b(n$2, 7) -b(n$2, 8):
%p A245038 seq(a(n), n=7..100);
%t A245038 b[n_, i_, k_] := b[n, i, k] = If[n == 0, 1, If[i < 1, 0, b[n, i - 1, k] + Sum[b[n - i*j, i - 1, k], {j, Max[1, k], n/i}]]];
%t A245038 a[n_] := b[n, n, 7] - b[n, n, 8];
%t A245038 Table[a[n], {n, 7, 100}] (* _Jean-François Alcover_, May 01 2018, translated from Maple *)
%Y A245038 Column k=7 of A243978.
%K A245038 nonn
%O A245038 7,15
%A A245038 _Joerg Arndt_ and _Alois P. Heinz_, Jul 10 2014