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.

A092493 a(n) = 4a(n-1) - 4a(n-2) + 3a(n-3) + a(n-4) - a(n-5).

Original entry on oeis.org

1, 2, 5, 14, 42, 128, 389, 1179, 3572, 10825, 32810, 99446, 301412, 913547, 2768863, 8392136, 25435699, 77092976, 233660832, 708201794, 2146486339, 6505777953, 19718339694, 59764246943, 181139247400, 549014312524, 1664005563066
Offset: 1

Views

Author

N. J. A. Sloane, Apr 04 2004

Keywords

Comments

Arises in enumeration of certain pattern-avoiding permutations.

Crossrefs

Programs

  • Maple
    a[1]:=1: a[2]:=2: a[3]:=5: a[4]:=14: a[5]:=42: for n from 6 to 32 do a[n]:=4*a[n-1]-4*a[n-2]+3*a[n-3]+a[n-4]-a[n-5] od: seq(a[j],j=1..32); # Emeric Deutsch, Apr 12 2005
  • Mathematica
    LinearRecurrence[{4,-4,3,1,-1},{1,2,5,14,42},40] (* Harvey P. Dale, Jul 14 2024 *)

Formula

G.f.: x*(1 - 2*x + x^2 - x^3 - x^4)/(1 - 4*x + 4*x^2 - 3*x^3 - x^4 + x^5). [Maksym Voznyy (voznyy(AT)mail.ru), Aug 12 2009; corrected by R. J. Mathar, Sep 16 2009]

Extensions

Edited by Emeric Deutsch, Apr 12 2005