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 A185200 #25 Apr 30 2016 11:24:57 %S A185200 6,8,8,10,12,10,12,16,20,12,14,20,38,28,14,16,24,60,52,48,16,18,28,80, %T A185200 84,134,60,18,20,32,100,124 %N A185200 Square array O(k,g) containing the least nontrivial order of disconnected k-regular simple graphs with girth at least g. %C A185200 This array is twice A054760. %C A185200 (A proof of the monotonicity with respect to girth appears in Holton & Sheehan) %H A185200 Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/D_k-reg_girth_ge_g_index">Index of sequences counting disconnected k-regular simple graphs with girth at least g</a> %Y A185200 Cf. A185204 - A185207: the triangular arrays D(n,k) counting disconnected k-regular simple graphs with girth at least g on n vertices, for 4 <= g <= 7. %K A185200 nonn,tabl,more,hard %O A185200 0,1 %A A185200 _Jason Kimberley_, Jan 25 2011