Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #11 Dec 30 2023 14:38:01
%S 3,4,14,1120,1129856000,1429646991180169216000000000,
%T 2922003679260403682236915960536301659966658013592289280000000000000000000000000000
%N Number of independent vertex sets in the n-Dorogovtsev-Goltsev-Mendes graph.
%C Using the indexing convention that DGM(0) = P_2.
%H Andrew Howroyd, <a href="/A368456/b368456.txt">Table of n, a(n) for n = 0..8</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Dorogovtsev-Goltsev-MendesGraph.html">Dorogovtsev-Goltsev-Mendes Graph</a>.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/IndependentVertexSet.html">Independent Vertex Set</a>.
%F a(n) = b(n) + 2*c(n) where b(0) = c(0) = 1 and c(n) = b(n-1)*c(n-1)^2, b(n) = c(n) + b(n-1)^3 for n > 0. - _Andrew Howroyd_, Dec 30 2023
%o (PARI) a(n) = {my(b=1, c=1); for(k=1, n, c = b*c^2; b = b^3 + c); b + 2*c} \\ _Andrew Howroyd_, Dec 30 2023
%K nonn
%O 0,1
%A _Eric W. Weisstein_, Dec 25 2023
%E a(0) prepended and terms a(5) and beyond from _Andrew Howroyd_, Dec 30 2023