Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 Dec 25 2020 13:04:43
%S 0,0,0,0,1,1,1,1,1,3,2,2,4,3,2,4,3,5,6,4,3,9,4,5,5,7,4,11
%N Number of non-isomorphic connected cubic cyclic Haar graphs of girth 6 on 2n vertices.
%C a(n) is also the number of connected cyclic configurations of type (n_3)
%C Sequence A098822 counts all cyclic configurations of type (n_3), while the present sequence counts only those that are connected.
%H N. Bašić, J. Grošelj, B. Grünbaum and T. Pisanski, <a href="https://doi.org/10.26493/1855-3974.1467.04b">Splittable and unsplittable graphs and configurations</a>, Ars Math. Contemp. 16 (2019), 1-17.
%H M. Petkovšek and T. Pisanski, <a href="https://hrcak.srce.hr/2545">Counting disconnected structures: chemical trees, fullerenes, I-graphs and others</a>, Croatica Chem. Acta 78 (2005), 563-567.
%Y Cf. A098822.
%K nonn,more
%O 3,10
%A _Nino Basic_, Dec 07 2020