cp's OEIS Frontend

A245041 Number of partitions of n where the minimal multiplicity of any part is 10.

%I A245041 #7 May 01 2018 04:10:20
%S A245041 1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,2,1,2,1,2,1,2,1,2,1,4,2,3,3,
%T A245041 3,2,4,2,3,3,6,3,6,4,6,4,6,3,7,4,9,6,11,7,13,11,14,12,17,13,25,18,24,
%U A245041 22,30,26,35,28,37,33,49,37,53,45,56,54,67,58
%N A245041 Number of partitions of n where the minimal multiplicity of any part is 10.
%H A245041 Joerg Arndt and Alois P. Heinz, <a href="/A245041/b245041.txt">Table of n, a(n) for n = 10..1000</a>
%p A245041 b:= proc(n, i, k) option remember; `if`(n=0, 1, `if`(i<1, 0,
%p A245041       b(n, i-1, k) +add(b(n-i*j, i-1, k), j=max(1, k)..n/i)))
%p A245041     end:
%p A245041 a:= n-> b(n$2, 10) -b(n$2, 11):
%p A245041 seq(a(n), n=10..100);
%t A245041 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 A245041 a[n_] := b[n, n, 10] - b[n, n, 11];
%t A245041 Table[a[n], {n, 10, 100}] (* _Jean-François Alcover_, May 01 2018, translated from Maple *)
%Y A245041 Column k=10 of A243978.
%K A245041 nonn
%O A245041 10,21
%A A245041 _Joerg Arndt_ and _Alois P. Heinz_, Jul 10 2014