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

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

%I

%S 1,1,3,7,20,63,233,966,4454,22404,121616,706361,4361910,28491982,

%T 196018395,1414922459,10677120529,83924901635,684582037213,

%U 5772723290503,50123602905429,446382776341382,4062023996661972,37638652689027910,354017801203414670

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

%H Alois P. Heinz, <a href="/A320741/b320741.txt">Table of n, a(n) for n = 0..1006</a>

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

%p Stirling2(n, j), j=0..10), 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, 10}], 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=10 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 March 25 09:41 EDT 2023. Contains 361520 sequences. (Running on oeis4.)