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

A297439
Number of maximum independent vertex sets and minimum vertex covers in the n-web graph.
0
4, 9, 8, 30, 16, 84, 32, 216, 64, 528, 128, 1248, 256, 2880, 512, 6528, 1024, 14592, 2048, 32256, 4096, 70656, 8192, 153600, 16384, 331776, 32768, 712704, 65536, 1523712, 131072, 3244032, 262144, 6881280, 524288, 14548992, 1048576, 30670848, 2097152
OFFSET
2,1
COMMENTS
Extended to a(2) using the formula/recurrence.
LINKS
Eric Weisstein's World of Mathematics, Maximum Independent Vertex Set
Eric Weisstein's World of Mathematics, Minimum Vertex Cover
Eric Weisstein's World of Mathematics, Web Graph
FORMULA
a(2n) = 2^(n+1), a(2n+1) = 3*2^(n - 1)*(2 n + 1).
a(n) = 4*a(n-2) - 4*a(n-4).
G.f.: x^2 (4 + 9*x - 8*x^2 - 6*x^3)/(-1 + 2*x^2)^2.
MATHEMATICA
Table[If[Mod[n, 2] == 0, 2^(n/2 + 1), 3 2^((n - 3)/2) n], {n, 2, 40}]
LinearRecurrence[{0, 4, 0, -4}, {4, 9, 8, 30}, 20]
CoefficientList[Series[(4 + 9 x - 8 x^2 - 6 x^3)/(-1 + 2 x^2)^2, {x, 0, 20}], x]
CROSSREFS
Sequence in context: A345283 A369750 A365780 * A168175 A164382 A145521
KEYWORD
nonn,easy
AUTHOR
Eric W. Weisstein, Jan 01 2018
STATUS
approved