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.

A116703 Number of permutations of length n which avoid the patterns 231, 4123.

Original entry on oeis.org

1, 2, 5, 13, 33, 82, 202, 497, 1224, 3017, 7439, 18343, 45228, 111514, 274945, 677894, 1671393, 4120937, 10160465, 25051354, 61765902, 152288233, 375477484, 925766477, 2282543187, 5627772815, 13875674756, 34211464510, 84350802705
Offset: 1

Views

Author

Lara Pudwell, Feb 26 2006

Keywords

Comments

Also number of permutations of length n which avoid the patterns 312, 2341, 3412; or avoid the patterns 132, 1324, 3214, etc.
Except for the offset, this is the p-INVERT of (1,1,1,1,1,...) for p(S) = 1 - S - S^3; see A291000. - Clark Kimberling, Aug 24 2017

Crossrefs

Cf. A000930.

Programs

  • Mathematica
    CoefficientList[Series[x*(1-2*x+2*x^2)/(1-4*x+5*x^2-3*x^3), {x, 0, 50}], x] (* G. C. Greubel, Apr 29 2017 *)
  • PARI
    x='x+O('x^50); Vec(x*(1-2*x+2*x^2)/(1-4*x+5*x^2-3*x^3)) \\ G. C. Greubel, Apr 29 2017

Formula

G.f.: -((2x^2-2x+1)x)/(3x^3-5x^2+4x-1).
Binomial transform of A000930 starting with offset 1: [1, 1, 2, 3, 4, 6, 9, ...]. - Gary W. Adamson, Oct 23 2007

Extensions

Edited by N. J. A. Sloane, Mar 16 2008