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 A184981 #11 May 01 2014 02:36:25 %S A184981 1,1,6,94,10786,3459386,1470293676,733351105935,1 %N A184981 Irregular triangle C(n,g) counting the connected 8-regular simple graphs on n vertices with girth at least g. %C A184981 The first column is for girth at least 3. The row length is incremented to g-2 when n reaches A054760(8,g). %H A184981 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> %e A184981 1; %e A184981 1; %e A184981 6; %e A184981 94; %e A184981 10786; %e A184981 3459386; %e A184981 1470293676; %e A184981 733351105935, 1; %e A184981 ?, 0; %e A184981 ?, 1; %e A184981 ?, 0; %e A184981 ?, 13; %e A184981 ?, 1; %Y A184981 Connected 8-regular simple graphs with girth at least g: this sequence (triangle); chosen g: A014378 (g=3), A181154 (g=4). %Y A184981 Connected 8-regular simple graphs with girth exactly g: A184980 (triangle); chosen g: A184983 (g=3). %Y A184981 Triangular arrays C(n,g) counting connected simple k-regular graphs on n vertices with girth at least g: A185131 (k=3), A184941 (k=4), A184951 (k=5), A184961 (k=6), A184971 (k=7), this sequence (k=8), A184991 (k=9). %K A184981 nonn,hard,more,tabf %O A184981 9,3 %A A184981 _Jason Kimberley_, Jan 19 2012