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 A210709 #18 Apr 05 2013 17:00:39 %S A210709 1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,18 %N A210709 Number of trivalent connected simple graphs with 2n nodes and girth at least 9. %H A210709 Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/C_k-reg_girth_ge_g_index">Index of sequences counting connected k-regular simple graphs with girth at least g</a> %F A210709 a(29) = a(A000066(9)/2) = A052453(9) = 18 is the number of (3,9) cages. %Y A210709 Trivalent 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), this sequence (g=9). %Y A210709 Trivalent simple graphs with girth exactly g: A198303 (triangle); chosen g: A006923 (g=3), A006924 (g=4), A006925 (g=5), A006926 (g=6), A006927 (g=7). %K A210709 nonn,more,hard,bref %O A210709 0,30 %A A210709 _Jason Kimberley_, Dec 20 2012