A245862 Number of preferential arrangements of n labeled elements such that the minimal number of elements per rank equals 9.
1, 0, 0, 0, 0, 0, 0, 0, 0, 48620, 184756, 335920, 587860, 994840, 1634380, 2615008, 4085950, 6249100, 227882805150, 1914150638400, 10597377540750, 42894094729200, 150967391072550, 488846715676800, 1495608303532200, 4389524294884872, 12479799500904120
Offset: 9
Keywords
Links
- Alois P. Heinz, Table of n, a(n) for n = 9..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, 9) -b(n, 10): seq(a(n), n=9..40);