|
%I #8 Dec 07 2020 09:04:14
%S 1,1,3,7,20,63,233,966,4454,22403,121570,705150,4337883,28091897,
%T 190105229,1334705996,9656244012,71551215515,540187472767,
%U 4137336876098,32036946594336,250131019258467,1965050543015106,15509209887539395,122829846706462146
%N Number of partitions of n with eight sorts of part 1 which are introduced in ascending order.
%H Alois P. Heinz, <a href="/A320739/b320739.txt">Table of n, a(n) for n = 0..1112</a>
%p b:= proc(n, i) option remember; `if`(n=0 or i<2, add(
%p Stirling2(n, j), j=0..8), 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, 8}], 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=8 of A292745.
%K nonn
%O 0,3
%A _Alois P. Heinz_, Oct 20 2018
|
