The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A320740 Number of partitions of n with nine sorts of part 1 which are introduced in ascending order. 4

%I

%S 1,1,3,7,20,63,233,966,4454,22404,121615,706306,4360204,28452601,

%T 195263881,1402218667,10482569938,81153069799,647261864569,

%U 5292447172261,44165731426846,374675276723042,3220404743013997,27967105952549269,244844437773618386

%N Number of partitions of n with nine sorts of part 1 which are introduced in ascending order.

%H Alois P. Heinz, <a href="/A320740/b320740.txt">Table of n, a(n) for n = 0..1053</a>

%p b:= proc(n, i) option remember; `if`(n=0 or i<2, add(

%p Stirling2(n, j), j=0..9), 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, 9}], 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=9 of A292745.

%K nonn

%O 0,3

%A _Alois P. Heinz_, Oct 20 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 1 09:24 EDT 2023. Contains 361688 sequences. (Running on oeis4.)