cp's OEIS Frontend

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

%I A245862 #4 Aug 04 2014 13:51:16
%S A245862 1,0,0,0,0,0,0,0,0,48620,184756,335920,587860,994840,1634380,2615008,
%T A245862 4085950,6249100,227882805150,1914150638400,10597377540750,
%U A245862 42894094729200,150967391072550,488846715676800,1495608303532200,4389524294884872,12479799500904120
%N A245862 Number of preferential arrangements of n labeled elements such that the minimal number of elements per rank equals 9.
%H A245862 Alois P. Heinz, <a href="/A245862/b245862.txt">Table of n, a(n) for n = 9..400</a>
%F A245862 E.g.f.: 1/(1-Sum_{j>=9} x^j/j!) - 1/(1-Sum_{j>=10} x^j/j!).
%F A245862 a(n) = A245794(n) - A245795(n) = A245732(n,9) - A245732(n,10).
%p A245862 b:= proc(n, k) option remember; `if`(n=0, 1,
%p A245862       add(b(n-j, k)*binomial(n, j), j=k..n))
%p A245862     end:
%p A245862 a:= n-> b(n, 9) -b(n, 10):
%p A245862 seq(a(n), n=9..40);
%Y A245862 Column k=9 of A245733.
%Y A245862 Cf. A245794, A245795, A245732.
%K A245862 nonn
%O A245862 9,10
%A A245862 _Alois P. Heinz_, Aug 04 2014