|
%I #9 May 25 2018 10:23:54
%S 0,0,0,0,0,0,0,0,0,0,2,1,7,25,228,1456
%N Number of nontrivial (triangle-free and girth >=5) stable snarks on 2n nodes.
%H J. Hagglund and K. Markstrom, <a href="https://doi.org/10.1016/j.disc.2011.08.024">On stable cycles and cycle double covers of graphs with large circumference</a>, Discrete Math., 312 (2012), 2540-2544.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Snark.html">Snark</a>
%Y Cf. A130315.
%K nonn,more
%O 1,11
%A _N. J. A. Sloane_, Jul 26 2012
|
