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.

A098808 a(n) = 2^(n + 11) - 11.

Original entry on oeis.org

2037, 4085, 8181, 16373, 32757, 65525, 131061, 262133, 524277, 1048565, 2097141, 4194293, 8388597, 16777205, 33554421, 67108853, 134217717, 268435445, 536870901, 1073741813, 2147483637, 4294967285, 8589934581, 17179869173
Offset: 0

Views

Author

Parthasarathy Nambi, Oct 06 2004

Keywords

Examples

			a(0) = 2^11 - 11 = 2037.
a(1) = 2^12 - 11 = 4085.
		

Crossrefs

Programs

Formula

From Colin Barker, May 11 2012: (Start)
a(n) = 3*a(n-1)-2*a(n-2).
G.f.: (2037-2026*x)/((1-x)*(1-2*x)). (End)

Extensions

More terms from Stefan Steinerberger, Mar 06 2006