login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A308579
a(n) = (9*2^n - 6*n - 10)/2.
0
1, 7, 22, 55, 124, 265, 550, 1123, 2272, 4573, 9178, 18391, 36820, 73681, 147406, 294859, 589768, 1179589, 2359234, 4718527, 9437116, 18874297, 37748662, 75497395, 150994864, 301989805, 603979690, 1207959463, 2415919012, 4831838113, 9663676318, 19327352731
OFFSET
1,2
COMMENTS
Number of connected induced subgraphs in the (2*n-1)-triangular snake graph.
LINKS
Eric Weisstein's World of Mathematics, Connected Graph
Eric Weisstein's World of Mathematics, Triangular Snake Graph
Eric Weisstein's World of Mathematics, Vertex-Induced Subgraph
FORMULA
a(n) = (9*2^n - 6*n - 10)/2.
a(n) = 4*a(n-1) - 5*a(n-2) + 2*a(n-3).
G.f.: x*(-1 - 3*x + x^2)/((-1 + x)^2*(-1 + 2*x)).
E.g.f.: exp(x)*(5*cosh(x) + 4*sinh(x) - 3*x - 5). - Stefano Spezia, May 31 2023
MATHEMATICA
Table[(9 2^n - 6 n - 10)/2, {n, 20}]
LinearRecurrence[{4, -5, 2}, {1, 7, 22}, 20]
CoefficientList[Series[(-1 - 3 x + x^2)/((-1 + x)^2 (-1 + 2 x)), {x, 0, 20}], x]
CROSSREFS
Sequence in context: A188377 A374973 A213585 * A246831 A354430 A122238
KEYWORD
nonn,easy
AUTHOR
Eric W. Weisstein, Jun 08 2019
STATUS
approved