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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A272500 Number of ordered set partitions of [n] with nondecreasing block sizes and maximal block size equal to ten. 2

%I #4 May 01 2016 17:58:18

%S 1,11,198,2860,47047,738738,12828816,223282488,4179020274,80464009340,

%T 1640551617848,34682405557800,770529476530814,17782248154604934,

%U 428864975324828328,10740325059575465640,279932748231053890830,7564798231253861700960,212075260563875086898520

%N Number of ordered set partitions of [n] with nondecreasing block sizes and maximal block size equal to ten.

%H Alois P. Heinz, <a href="/A272500/b272500.txt">Table of n, a(n) for n = 10..450</a>

%F E.g.f.: x^10 * Product_{i=1..10} (i-1)!/(i!-x^i).

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

%p b(n, i-1)+`if`(i>n, 0, binomial(n, i)*b(n-i, i))))

%p end:

%p a:= n-> (k-> b(n, k) -b(n, k-1))(10):

%p seq(a(n), n=10..30);

%Y Column k=10 of A262071.

%K nonn

%O 10,2

%A _Alois P. Heinz_, May 01 2016

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 08:27 EDT 2024. Contains 371698 sequences. (Running on oeis4.)