|
%I #12 Dec 22 2018 04:49:35
%S 0,0,0,0,1,0,0,0,0,1,0,0,0,0,2,1,2,1,2,3,3,2,4,2,6,4,5,4,7,7,8,8,10,
%T 11,18,13,19,19,22,29,32,29,37,37,53,48,60,54,68,79,84,86,104,99,133,
%U 125,149,151,183,191,219,223,259,268,335,320,377,391,448,487,547,552,640,666,781,795,908,923,1057,1139,1246,1312,1472,1508,1754
%N Number of partitions of n where the minimal multiplicity of any part is 5.
%C Column k=5 of A243978.
%H Joerg Arndt and Alois P. Heinz, <a href="/A244518/b244518.txt">Table of n, a(n) for n = 1..1000</a>
%p b:= proc(n, i, k) option remember; `if`(n=0, 1, `if`(i<1, 0,
%p b(n, i-1, k) +add(b(n-i*j, i-1, k), j=max(1, k)..n/i)))
%p end:
%p a:= n-> b(n$2, 5) -b(n$2, 6):
%p seq(a(n), n=1..100);
%t 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 a[n_] := b[n, n, 5] - b[n, n, 6];
%t Array[a, 100] (* _Jean-François Alcover_, May 01 2018, translated from Maple *)
%K nonn
%O 1,15
%A _Joerg Arndt_ and _Alois P. Heinz_, Jun 29 2014
|
