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”).

A362501
Number of vertex cuts in the n-alkane graph.
1
11, 169, 1699, 14989, 125495, 1026273, 8299403, 66752053, 535443679, 4289258377, 34336902707, 274786564317, 2198657885063, 17590724562481, 140731642427611, 1125876523131781, 9007105719897647, 72057219898554585, 576459255745930115, 4611680032197414445
OFFSET
1,1
LINKS
Eric Weisstein's World of Mathematics, Alkane Graph
Eric Weisstein's World of Mathematics, Vertex Cut
FORMULA
a(n) = 4*8^n - (49*4^n + 6*n - 13)/9. - Andrew Howroyd, Apr 23 2023
a(n) = 14*a(n-1) - 57*a(n-2) + 76*a(n-3) - 32*a(n-4) for n >= 5. - Pontus von Brömssen, Apr 23 2023
CROSSREFS
Sequence in context: A059091 A255971 A157944 * A233290 A167245 A331929
KEYWORD
nonn,easy
AUTHOR
Eric W. Weisstein, Apr 23 2023
EXTENSIONS
Terms a(8) and beyond from Andrew Howroyd, Apr 23 2023
STATUS
approved