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 A184991 #7 May 01 2014 02:37:01 %S A184991 1,9,88193,113314233813 %N A184991 Irregular triangle C(n,g) counting the connected 9-regular simple graphs on 2n vertices with girth at least g. %C A184991 The first column is for girth at least 3. The row length is incremented to g-2 when 2n reaches A054760(9,g). %H A184991 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 A184991 1; %e A184991 9; %e A184991 88193; %e A184991 113314233813; %e A184991 ?, 1; %e A184991 ?, 1; %e A184991 ?, 14; %Y A184991 Connected 9-regular simple graphs with girth at least g: this sequence (triangle); chosen g: A014381 (g=3), A181170 (g=4). %Y A184991 Connected 9-regular simple graphs with girth exactly g: A184990 (triangle); chosen g: A184983 (g=3). %Y A184991 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), A184981 (k=8), this sequence (k=9). %K A184991 nonn,hard,more,tabf %O A184991 5,2 %A A184991 _Jason Kimberley_, Feb 03 2012