cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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

Views

Author

Alois P. Heinz, Aug 04 2014

Keywords

Crossrefs

Column k=10 of A245733.

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);

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).