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 A185314 #26 Nov 04 2013 04:03:30 %S A185314 1,1,2,1,3,2,4,2,7,3,14,6,44,37,350,1616,18042,193919,2867779, %T A185314 32674078,1581632332,6705889886 %N A185314 Number of, not necessarily connected, regular simple graphs on n vertices with girth at least 4. %H A185314 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 A185314 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 A185314 a(n) = A186724(n) + A185214(n). %F A185314 a(n) is the sum of the n-th row of A185304. %Y A185314 Regular graphs, of any degree, with girth at least 4: A186724 (connected), A185214 (disconnected), this sequence (not-necessarily connected). %Y A185314 Not necessarily connected k-regular simple graphs with girth at least 4: this sequence (any k), A185304 (triangle); specified degree k: A008484 (k=2), A185334 (k=3), A185344 (k=4), A185354 (k=5), A185364 (k=6). %Y A185314 Not necessarily connected regular simple graphs with girth at least g: A005176 (g=3), this sequence (g=4), A185315 (g=5), A185316 (g=6), A185317 (g=7), A185318 (g=8), A185319 (g=9). %K A185314 nonn,more,hard %O A185314 0,3 %A A185314 _Jason Kimberley_, May 23 2012