login
Number of unlabeled connected loopless multigraphs with n nodes of degree 3 or less and with single or double edges.
3

%I #33 Mar 20 2020 15:10:05

%S 1,1,2,4,12,22,68,166,534,1589,5464,18579,68320,255424,1000852,

%T 4018156,16671976,70890940,309439942,1381815168,6310880471,

%U 29428287639,140012980007,678970863717,3353545264060,16857749613964,86191265140699,447951112379963,2365177154077186

%N Number of unlabeled connected loopless multigraphs with n nodes of degree 3 or less and with single or double edges.

%C For n >= 1, a(n) is also the number of hydronitrogen molecules containing only n nitrogen trivalent (octet rule satisfying) atoms. So for example, diazene is counted but hydrazoic acid is not because the former has only trivalent nitrogens and the latter has two non-trivalent nitrogens.

%C Some of the molecules are theoretical and may or may not exist due to their strained geometries.

%C Apparently the same as A243391 for n > 2. - _Georg Fischer_, Oct 16 2018

%C This is the case since A243391 gives the number of loopless multigraphs with nodes of degree 3 or less. The extra graph in A243391 is the 3-regular graph on 2 nodes. - _Andrew Howroyd_, Mar 20 2020

%F a(n) = A243391(n) for n > 2. - _Andrew Howroyd_, Mar 20 2020

%e a(3) = 4 because there are 4 molecules satisfying the above condition: triazane, triazene, triazirine, triazidirine.

%e Note: hydrazoic acid is not counted because there are 2 nitrogens not satisfying the octet rule (one has a positive formal charge and the other one has a negative one).

%e Graphically, a(3) = 4 because there are 4 graphs satisfying the above condition: the linear graph, the linear graph with one double edge, the triangle graph, and the triangle graph with one double edge. - _Michael B. Porter_, Apr 28 2018

%o (nauty/shell) for n in {1..18}; do geng -c -D3 ${n} -q | multig -m2 -D3 -u;done

%Y Cf. A134818, A243391, A289158, A303031.

%K nonn

%O 0,3

%A _Natan Arie Consigli_, Apr 17 2018

%E a(20)-a(28) from _Andrew Howroyd_, Mar 20 2020