OFFSET
0,1
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
LINKS
Seiichi Manyama, Table of n, a(n) for n = 0..3000
Eric Weisstein's World of Mathematics, Connected Dominating Set
Eric Weisstein's World of Mathematics, Wheel Graph
Index entries for linear recurrences with constant coefficients, signature (4,-5,2).
FORMULA
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
MAPLE
seq(2^n+2*n+1, n=0..35); # Muniru A Asiru, Mar 25 2018
MATHEMATICA
Table[2^n + 2 n + 1, {n, 0, 60}] (* Vladimir Joseph Stephan Orlovsky, Feb 15 2011 *)
LinearRecurrence[{4, -5, 2}, {2, 5, 9}, 40] (* Vincenzo Librandi, Aug 12 2015 *)
CoefficientList[Series[(-2 + 3 x + x^2)/((-1 + x)^2 (-1 + 2 x)), {x, 0, 20}], x] (* Eric W. Weisstein, Aug 30 2017 *)
PROG
(PARI) vector(40, n, n--; 2^n + 2*n + 1) \\ Michel Marcus, Aug 12 2015
(Magma) [2^n + 2*n + 1: n in [0..40]]; // Vincenzo Librandi, Aug 12 2015
(GAP) List([0..35], n->2^n+2*n+1); # Muniru A Asiru, Mar 25 2018
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Jonathan Vos Post, Apr 23 2010
EXTENSIONS
Corrected (one 1048617 replaced by 2097195) by R. J. Mathar, Apr 28 2010
STATUS
approved