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.

A276930 Number of ordered set partitions of [n] with at most ten elements per block.

Original entry on oeis.org

1, 1, 3, 13, 75, 541, 4683, 47293, 545835, 7087261, 102247563, 1622632572, 28091567570, 526858347730, 10641342953670, 230283190536542, 5315654669985946, 130370766690581274, 3385534653313192094, 92801587015186096762, 2677687786557636155446
Offset: 0

Views

Author

Alois P. Heinz, Sep 22 2016

Keywords

Crossrefs

Column k=10 of A276921.
Cf. A229227.

Programs

  • Maple
    a:= proc(n) option remember; `if`(n=0, 1, add(
           a(n-i)*binomial(n, i), i=1..min(n, 10)))
        end:
    seq(a(n), n=0..25);
  • Mathematica
    max = 25; CoefficientList[1/(1-Sum[x^i/i!, {i, 1, 10}]) + O[x]^(max+1), x]* Range[0, max]! (* Jean-François Alcover, May 24 2018 *)

Formula

E.g.f.: 1/(1-Sum_{i=1..10} x^i/i!).