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.

A168614 a(n) = 2^n + 5.

Original entry on oeis.org

6, 7, 9, 13, 21, 37, 69, 133, 261, 517, 1029, 2053, 4101, 8197, 16389, 32773, 65541, 131077, 262149, 524293, 1048581, 2097157, 4194309, 8388613, 16777221, 33554437, 67108869, 134217733, 268435461, 536870917, 1073741829, 2147483653
Offset: 0

Views

Author

Vincenzo Librandi, Dec 01 2009

Keywords

Programs

Formula

a(n) = 2*a(n-1) - 5 with n>0, a(0)=6.
From Colin Barker, Jul 01 2012: (Start)
a(n) = 3*a(n-1) - 2*a(n-2).
G.f.: (6 - 11*x)/((1-x)*(1-2*x)). (End)
E.g.f.: exp(2*x) + 5*exp(x). - G. C. Greubel, Jul 27 2016

Extensions

Checked by Michael B. Porter, Jun 16 2010