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.

A176691 a(n) = 2^n + 2*n + 1.

Original entry on oeis.org

2, 5, 9, 15, 25, 43, 77, 143, 273, 531, 1045, 2071, 4121, 8219, 16413, 32799, 65569, 131107, 262181, 524327, 1048617, 2097195, 4194349, 8388655, 16777265, 33554483, 67108917, 134217783, 268435513, 536870971, 1073741885, 2147483711, 4294967361, 8589934659, 17179869253
Offset: 0

Views

Author

Jonathan Vos Post, Apr 23 2010

Keywords

Comments

The subsequence of primes in this sequence is A163115.
Also the number of connected dominating sets in the (n+1)-wheel graph. - Eric W. Weisstein, Aug 30 2017

Crossrefs

Programs

Formula

a(n) = 2^n + 2*n + 1 = A000079(n) + A005843(n) + 1 = A000051(n) + A005843(n).
From R. J. Mathar, Apr 28 2010: (Start)
a(n) = 4*a(n-1) - 5*a(n-2) + 2*a(n-3).
G.f.: (-2 + 3*x + x^2)/((2*x - 1)*(x - 1)^2). (End)
E.g.f.: exp(x)*(1 + exp(x) + 2*x). - Stefano Spezia, May 06 2023

Extensions

Corrected (one 1048617 replaced by 2097195) by R. J. Mathar, Apr 28 2010