%I #22 Dec 03 2024 11:16:48
%S 1,1,2,6,10,29,64,194,531,1733,5524,19430,69322,262044,1016740,
%T 4101318,16996157,72556640,317558689,1424644848,6536588420,
%U 30647561117,146647344812,715511358833,3556531372395,17996244725780,92634418530686,484756161038264
%N Number of isomorphism classes of connected 3-regular loopless simple graphs with n vertices and with semi-edges allowed.
%C Also: number of isomorphism classes of connected loopless simple graphs with maximum degree at most 3. - _Brendan McKay_, Mar 11 2020
%H Nino Bašić and Ivan Damnjanović, <a href="https://arxiv.org/abs/2411.16904">On cubic polycirculant nut graphs</a>, arXiv:2411.16904 [math.CO], 2024. See p. 22.
%H Gunnar Brinkmann, Nico Van Cleemput, and Tomaž Pisanski, <a href="http://dx.doi.org/10.1016/j.tcs.2012.01.018">Generation of various classes of trivalent graphs</a>, Theoretical Comp. Sci. (2013) Vol. 502, 16-29.
%Y Cf. A121941, A243391, A243392, A243394, A303032.
%K nonn
%O 1,3
%A _Nico Van Cleemput_, Jun 04 2014
%E a(24)-a(28) from _Andrew Howroyd_, Mar 20 2020