A245863 Number of preferential arrangements of n labeled elements such that the minimal number of elements per rank equals 10.
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
Offset: 10
Keywords
Links
- Alois P. Heinz, Table of n, a(n) for n = 10..400
Programs
-
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);