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!)
A245863 Number of preferential arrangements of n labeled elements such that the minimal number of elements per rank equals 10. 2
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 184756, 705432, 1293292, 2288132, 3922512, 6537520, 10623470, 16872570, 26246220, 40060020, 5551056881370, 46931243394750, 261676870328640, 1068586476534720, 3799188975290280, 12437959723060872, 38494099921844952 (list; graph; refs; listen; history; text; internal format)
OFFSET
10,11
LINKS
FORMULA
E.g.f.: 1/(1-Sum_{j>=10} x^j/j!) - 1/(1-Sum_{j>=11} x^j/j!).
a(n) = A245795(n) - A245732(n,11) = A245732(n,10) - A245732(n,11).
MAPLE
b:= proc(n, k) option remember; `if`(n=0, 1,
add(b(n-j, k)*binomial(n, j), j=k..n))
end:
a:= n-> b(n, 10) -b(n, 11):
seq(a(n), n=10..40);
CROSSREFS
Column k=10 of A245733.
Sequence in context: A268853 A024754 A024762 * A140933 A244173 A245795
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Aug 04 2014
STATUS
approved

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 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)