login
Number of preferential arrangements of n labeled elements such that the minimal number of elements per rank equals 10.
2

%I #4 Aug 04 2014 13:57:52

%S 1,0,0,0,0,0,0,0,0,0,184756,705432,1293292,2288132,3922512,6537520,

%T 10623470,16872570,26246220,40060020,5551056881370,46931243394750,

%U 261676870328640,1068586476534720,3799188975290280,12437959723060872,38494099921844952

%N Number of preferential arrangements of n labeled elements such that the minimal number of elements per rank equals 10.

%H Alois P. Heinz, <a href="/A245863/b245863.txt">Table of n, a(n) for n = 10..400</a>

%F E.g.f.: 1/(1-Sum_{j>=10} x^j/j!) - 1/(1-Sum_{j>=11} x^j/j!).

%F a(n) = A245795(n) - A245732(n,11) = A245732(n,10) - A245732(n,11).

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

%p add(b(n-j, k)*binomial(n, j), j=k..n))

%p end:

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

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

%Y Column k=10 of A245733.

%Y Cf. A245795, A245732.

%K nonn

%O 10,11

%A _Alois P. Heinz_, Aug 04 2014