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.

A133993 a(n) = a(n-1) + 3*a(n-2) - a(n-3) - 2*a(n-4), n > 3.

Original entry on oeis.org

1, 2, 3, 4, 9, 14, 31, 56, 117, 226, 459, 908, 1825, 3638, 7287, 14560, 29133, 58250, 116515, 233012, 466041, 932062, 1864143, 3728264, 7456549, 14913074, 29826171, 59652316, 119304657, 238609286, 477218599, 954437168, 1908874365, 3817748698, 7635497427
Offset: 0

Views

Author

Paul Curtz, Jan 22 2008

Keywords

Crossrefs

Equals 1 + A103196(n-1) for n>0. - Greg Dresden, Feb 21 2020

Programs

  • Mathematica
    LinearRecurrence[{1,3,-1,-2},{1,2,3,4},40] (* Harvey P. Dale, Aug 03 2018 *)

Formula

a(n) = 1+4*2^n/9+(-1)^n*(n/3-4/9).
G.f.: ( 1+x-2*x^2-4*x^3 ) / ( (2*x-1)*(x-1)*(1+x)^2 ).
a(n) = 3*a(n-2) + 2*a(n-3) - 4, for n>2. - Greg Dresden, Feb 21 2020
E.g.f.: (1/9)*(4*cosh(2*x) + (13 + 3*x)*sinh(x) + cosh(x)*(5 - 3*x + 8*sinh(x))). - Stefano Spezia, Feb 22 2020

Extensions

More terms from Harvey P. Dale, Aug 03 2018