cp's OEIS Frontend

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

%I A245863 #4 Aug 04 2014 13:57:52
%S A245863 1,0,0,0,0,0,0,0,0,0,184756,705432,1293292,2288132,3922512,6537520,
%T A245863 10623470,16872570,26246220,40060020,5551056881370,46931243394750,
%U A245863 261676870328640,1068586476534720,3799188975290280,12437959723060872,38494099921844952
%N A245863 Number of preferential arrangements of n labeled elements such that the minimal number of elements per rank equals 10.
%H A245863 Alois P. Heinz, <a href="/A245863/b245863.txt">Table of n, a(n) for n = 10..400</a>
%F A245863 E.g.f.: 1/(1-Sum_{j>=10} x^j/j!) - 1/(1-Sum_{j>=11} x^j/j!).
%F A245863 a(n) = A245795(n) - A245732(n,11) = A245732(n,10) - A245732(n,11).
%p A245863 b:= proc(n, k) option remember; `if`(n=0, 1,
%p A245863       add(b(n-j, k)*binomial(n, j), j=k..n))
%p A245863     end:
%p A245863 a:= n-> b(n, 10) -b(n, 11):
%p A245863 seq(a(n), n=10..40);
%Y A245863 Column k=10 of A245733.
%Y A245863 Cf. A245795, A245732.
%K A245863 nonn
%O A245863 10,11
%A A245863 _Alois P. Heinz_, Aug 04 2014