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.

A370383 Number of permutations of [n] having no substring [k,k+1,k+2,k+3,k+4].

Original entry on oeis.org

1, 1, 2, 6, 24, 119, 717, 5026, 40242, 362376, 3625081, 39885851, 478714416, 6224078292, 87145277160, 1307271652917, 20917481850667, 355612235468396, 6401234296266540, 121626707638142280, 2432586885636105251, 51085230669413519349, 1123891538655073251190
Offset: 0

Views

Author

Seiichi Manyama, Feb 17 2024

Keywords

Crossrefs

Programs

  • PARI
    my(N=30, x='x+O('x^N)); Vec(sum(k=0, N, k!*((x-x^5)/(1-x^5))^k))

Formula

G.f.: Sum_{k>=0} k! * ( (x-x^5)/(1-x^5) )^k.
a(n) = Sum_{k=0..4} A184182(n,k). - Alois P. Heinz, Feb 17 2024