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.

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

Original entry on oeis.org

1, 0, 0, 0, 0, 0, 0, 0, 12870, 48620, 87516, 151164, 251940, 406980, 639540, 980628, 9466982712, 78881427900, 432962644400, 1733914096200, 6029537213700, 19273224716460, 58178097911700, 168431757261300, 100033451495909100, 1461521434059544572
Offset: 8

Views

Author

Alois P. Heinz, Aug 04 2014

Keywords

Crossrefs

Column k=8 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, 8) -b(n, 9):
    seq(a(n), n=8..35);

Formula

E.g.f.: 1/(1-Sum_{j>=8} x^j/j!) - 1/(1-Sum_{j>=9} x^j/j!).
a(n) = A245793(n) - A245794(n) = A245732(n,8) - A245732(n,9).