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 A260811 #20 Jun 03 2023 12:02:04 %S A260811 1,0,0,0,0,0,0,1,1,3,10,28,162,1201,11415,125571,1514489 %N A260811 Number of trivalent bipartite connected simple graphs with 2n nodes and girth at least 6. %C A260811 The null graph on 0 vertices is vacuously connected, 3-regular, and bipartite; since it is acyclic, it has infinite girth. %H A260811 G. Brinkmann, <a href="http://dx.doi.org/10.1002/(SICI)1097-0118(199610)23:2<139::AID-JGT5>3.0.CO;2-U">Fast generation of cubic graphs</a>, Journal of Graph Theory, 23(2):139-149, 1996. %H A260811 House of Graphs, <a href="https://houseofgraphs.org/meta-directory/cubic#cubic_bipartite">Cubic bipartite graphs</a> %Y A260811 Connected 3-regular simple graphs with girth at least g: A185131 (triangle); chosen g: A002851 (g=3), A014371 (g=4), A014372 (g=5), A014374 (g=6), A014375 (g=7), A014376 (g=8). %Y A260811 Connected bipartite trivalent simple graphs with girth at least g: A006823 (g=4), this sequence (g=6), A260813 (g=8). %K A260811 nonn,more,hard %O A260811 0,10 %A A260811 _Dylan Thurston_, Jul 31 2015