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.

A116735 Number of permutations of length n which avoid the patterns 231, 1234, 4312; or avoid the patterns 312, 1234, 1432, etc.

Original entry on oeis.org

1, 2, 5, 12, 23, 38, 57, 80, 107, 138, 173, 212, 255, 302, 353, 408, 467, 530, 597, 668, 743, 822, 905, 992, 1083, 1178, 1277, 1380, 1487, 1598, 1713, 1832, 1955, 2082, 2213, 2348, 2487, 2630, 2777, 2928, 3083, 3242, 3405, 3572, 3743, 3918, 4097, 4280, 4467
Offset: 1

Views

Author

Lara Pudwell, Feb 26 2006

Keywords

Comments

a(n) is the number of permutations pi of length n such that pi and pi^2 both avoid 132 and 3421. - Colin Defant, Jul 24 2019

Programs

Formula

G.f.: x*(1 - x + 2*x^2 + 2*x^3)/(1-x)^3.
For n >= 2, a(n) = 2*n^2 - 7*n + 8. - Franklin T. Adams-Watters, Sep 16 2006
a(n) = A096376(n-2), n > 1. - R. J. Mathar, Aug 10 2008
E.g.f.: -8 - 2*x + (8 - 5*x + 2*x^2)*exp(x). - G. C. Greubel, Aug 10 2019