|
%I #23 Mar 18 2020 09:00:34
%S 1,0,0,0,0,1,1,7,388,406824,1125022326,3813549359275
%N Number of not necessarily connected 5-regular simple graphs on 2n vertices with girth at least 4.
%H Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/E_girth_ge_4">Not necessarily connected k-regular graphs with girth at least 4</a>
%H Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/E_k-reg_girth_ge_g_index">Index of sequences counting not necessarily connected k-regular simple graphs with girth at least g</a>
%F This sequence is the Euler transformation of A058275.
%F a(n) = A058275(n) + A185254(n).
%t A058275 = Cases[Import["https://oeis.org/A058275/b058275.txt", "Table"], {_, _}][[All, 2]];
%t (* EulerTransform is defined in A005195 *)
%t EulerTransform[Rest @ A058275] (* _Jean-François Alcover_, Dec 04 2019, updated Mar 18 2020 *)
%Y 5-regular simple graphs on 2n vertices with girth at least 4: A058275 (connected), A185254 (disconnected), this sequence (not necessarily connected).
%Y Not necessarily connected k-regular simple graphs with girth at least 4: A185314 (any k), A185304 (triangle); specified degree k: A008484 (k=2), A185334 (k=3), A185344 (k=4), this sequence (k=5), A185364 (k=6).
%K hard,nonn,more
%O 0,8
%A _Jason Kimberley_, Nov 04 2011
| 