This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A339505 #7 Dec 25 2020 13:04:43 %S A339505 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 A339505 Number of non-isomorphic connected cubic cyclic Haar graphs of girth 6 on 2n vertices. %C A339505 a(n) is also the number of connected cyclic configurations of type (n_3) %C A339505 Sequence A098822 counts all cyclic configurations of type (n_3), while the present sequence counts only those that are connected. %H A339505 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 A339505 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 A339505 Cf. A098822. %K A339505 nonn,more %O A339505 3,10 %A A339505 _Nino Basic_, Dec 07 2020