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.

A135522 a(n) = 2*a(n-1) + 3*a(n-2), with a(0) = 2 and a(1) = 3.

Original entry on oeis.org

2, 3, 12, 33, 102, 303, 912, 2733, 8202, 24603, 73812, 221433, 664302, 1992903, 5978712, 17936133, 53808402, 161425203, 484275612, 1452826833, 4358480502, 13075441503, 39226324512, 117678973533, 353036920602, 1059110761803
Offset: 0

Views

Author

Paul Curtz, Feb 19 2008

Keywords

Comments

Also: inverse binomial transform of A135520. - R. J. Mathar, Apr 17 2008

Crossrefs

Cf. A060925.

Programs

Formula

From R. J. Mathar, Feb 23 2008: (Start)
O.g.f.: (5/(1-3*x) + 3/(1+x))/4.
a(n) = (5*3^n + 3*(-1)^n)/4. (End)
G.f.: (x-2)/(3*x^2 + 2*x - 1). - Harvey P. Dale, Mar 14 2011
E.g.f.: (1/4)*(5*exp(3*x) + 3*exp(-x)). - G. C. Greubel, Oct 17 2016

Extensions

More terms from R. J. Mathar, Feb 23 2008