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.

A230236 Number of permutations of [n] in which the longest increasing run has length 10.

Original entry on oeis.org

1, 20, 349, 5954, 103194, 1845480, 34288800, 663848640, 13406178240, 282398538240, 6201593613645, 141859542537845, 3376683552323421, 83546513273754977, 2146303277645066980, 57187254952684274700, 1578640101972070456800, 45101111852055549981600
Offset: 10

Views

Author

Alois P. Heinz, Oct 12 2013

Keywords

Crossrefs

Column k=10 of A008304.

Programs

  • Maple
    b:= proc(u, o, t, k) option remember; `if`(u+o=0, 1,
          `if`(t b(n, 0, 0, 10)-b(n, 0, 0, 9):
    seq(a(n), n=10..30);

Formula

E.g.f.: 1/Sum_{n>=0} (11*n+1-x)*x^(11*n)/(11*n+1)! - 1/Sum_{n>=0} (10*n+1-x)*x^(10*n)/(10*n+1)!.
a(n) = A230233(n) - A230232(n).