The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A290718 a(n) = 2^(n + 1) + 4^(n - 1) - 2. 0
3, 10, 30, 94, 318, 1150, 4350, 16894, 66558, 264190, 1052670, 4202494, 16793598, 67141630, 268500990, 1073872894, 4295229438, 17180393470, 68720525310, 274880004094, 1099515822078, 4398054899710, 17592202821630, 70368777732094, 281475043819518, 1125900041060350, 4503599895805950, 18014399046352894, 72057595111669758 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
For n > 2, also the number of connected (non-null) induced subgraphs in the n-barbell graph.
LINKS
Eric Weisstein's World of Mathematics, Barbell Graph
Eric Weisstein's World of Mathematics, Connected Graph
Eric Weisstein's World of Mathematics, Vertex-Induced Subgraph
FORMULA
a(n) = 2^(n + 1) + 4^(n - 1) - 2.
a(n) = 7*a(n-1) - 14*a(n-2) + 8*a(n-3).
G.f.: (x (-3 + 11 x - 2 x^2))/(-1 + 7 x - 14 x^2 + 8 x^3).
MATHEMATICA
Table[2^(n + 1) + 4^(n - 1) - 2, {n, 20}]
LinearRecurrence[{7, -14, 8}, {3, 10, 30}, 40]
CoefficientList[Series[(-3 + 11 x - 2 x^2)/(-1 + 7 x - 14 x^2 + 8 x^3), {x, 0, 20}], x]
PROG
(PARI) a(n)=2^(n+1)+4^(n-1)-2 \\ Charles R Greathouse IV, Aug 09 2017
CROSSREFS
Sequence in context: A269800 A033113 A360714 * A300421 A302289 A003441
KEYWORD
nonn,easy
AUTHOR
Eric W. Weisstein, Aug 09 2017
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 3 13:35 EDT 2024. Contains 373060 sequences. (Running on oeis4.)