|
%I #8 Dec 07 2020 08:11:37
%S 1,1,3,7,19,52,151,442,1314,3921,11737,35171,105464,316318,948863,
%T 2846461,8539221,25617443,76852054,230555794,691666924,2075000173,
%U 6224999772,18674998357,56024993883,168074980137,504224938548,1512674813304,4538024437036
%N Number of partitions of n with three sorts of part 1 which are introduced in ascending order.
%H Alois P. Heinz, <a href="/A320734/b320734.txt">Table of n, a(n) for n = 0..2097</a>
%p b:= proc(n, i) option remember; `if`(n=0 or i<2, add(
%p Stirling2(n, j), j=0..3), add(b(n-i*j, i-1), j=0..n/i))
%p end:
%p a:= n-> b(n$2):
%p seq(a(n), n=0..40);
%t b[n_, i_] := b[n, i] = If[n == 0 || i < 2, Sum[StirlingS2[n, j], {j, 0, 3}], Sum[b[n - i j, i - 1], {j, 0, n/i}]];
%t a[n_] := b[n, n];
%t a /@ Range[0, 40] (* _Jean-François Alcover_, Dec 07 2020, after _Alois P. Heinz_ *)
%Y Column k=3 of A292745.
%K nonn
%O 0,3
%A _Alois P. Heinz_, Oct 20 2018
|
