cp's OEIS Frontend

A245037 Number of partitions of n where the minimal multiplicity of any part is 6.

%I A245037 #8 May 01 2018 04:10:06
%S A245037 1,0,0,0,0,0,1,0,0,0,0,0,2,1,2,1,2,1,4,2,3,3,3,2,7,3,5,5,6,3,11,5,10,
%T A245037 9,12,10,21,13,20,19,26,21,38,26,38,37,45,39,66,50,64,63,77,67,104,83,
%U A245037 110,102,124,112,166,138,176,174,204,189,264,230,288
%N A245037 Number of partitions of n where the minimal multiplicity of any part is 6.
%H A245037 Joerg Arndt and Alois P. Heinz, <a href="/A245037/b245037.txt">Table of n, a(n) for n = 6..1000</a>
%p A245037 b:= proc(n, i, k) option remember; `if`(n=0, 1, `if`(i<1, 0,
%p A245037       b(n, i-1, k) +add(b(n-i*j, i-1, k), j=max(1, k)..n/i)))
%p A245037     end:
%p A245037 a:= n-> b(n$2, 6) -b(n$2, 7):
%p A245037 seq(a(n), n=6..100);
%t A245037 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 A245037 a[n_] := b[n, n, 6] - b[n, n, 7];
%t A245037 Table[a[n], {n, 6, 100}] (* _Jean-François Alcover_, May 01 2018, translated from Maple *)
%Y A245037 Column k=6 of A243978.
%K A245037 nonn
%O A245037 6,13
%A A245037 _Joerg Arndt_ and _Alois P. Heinz_, Jul 10 2014