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.

A098992 Number of permutations of [n] with exactly 2 descents which avoid the pattern 1324.

Original entry on oeis.org

0, 0, 1, 11, 55, 190, 526, 1254, 2682, 5280, 9735, 17017, 28457, 45838, 71500, 108460, 160548, 232560, 330429, 461415, 634315, 859694, 1150138, 1520530, 1988350, 2574000, 3301155, 4197141, 5293341, 6625630, 8234840, 10167256, 12475144, 15217312, 18459705
Offset: 1

Views

Author

Mike Zabrocki, Nov 05 2004

Keywords

Crossrefs

Programs

  • PARI
    concat(vector(2), Vec(x^3*(1 + 3*x - 5*x^2 + 2*x^3) / (1 - x)^8 + O(x^30))) \\ Colin Barker, Oct 26 2017

Formula

G.f.: x^3*(1 + 3*x - 5*x^2 + 2*x^3) / (1 - x)^8.
From Colin Barker, Oct 26 2017: (Start)
a(n) = (n*(-540 + 476*n + 469*n^2 - 490*n^3 + 70*n^4 + 14*n^5 + n^6)) / 5040.
a(n) = 8*a(n-1) - 28*a(n-2) + 56*a(n-3) - 70*a(n-4) + 56*a(n-5) - 28*a(n-6) + 8*a(n-7) - a(n-8) for n>8.
(End)