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 A184980 #9 May 01 2014 02:36:25 %S A184980 1,1,6,94,10786,3459386,1470293676,733351105934,1 %N A184980 Irregular triangle C(n,g) counting the connected 8-regular simple graphs on n vertices with girth exactly g. %C A184980 The first column is for girth at least 3. The row length is incremented to g-2 when 2n reaches A054760(8,g). %H A184980 Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/C_k-reg_girth_eq_g_index">Index of sequences counting connected k-regular simple graphs with girth exactly g</a> %e A184980 1; %e A184980 1; %e A184980 6; %e A184980 94; %e A184980 10786; %e A184980 3459386; %e A184980 1470293676; %e A184980 733351105934, 1; %e A184980 ?, 0; %e A184980 ?, 1; %e A184980 ?, 0; %e A184980 ?, 13; %e A184980 ?, 1; %Y A184980 Connected 8-regular simple graphs with girth at least g: A184981 (triangle); chosen g: A014378 (g=3), A181154 (g=4). %Y A184980 Connected 8-regular simple graphs with girth exactly g: this sequence (triangle); chosen g: A184983 (g=3). %Y A184980 Triangular arrays C(n,g) counting connected simple k-regular graphs on n vertices with girth exactly g: A198303 (k=3), A184940 (k=4), A184950 (k=5), A184960 (k=6), A184970 (k=7), this sequence (k=8). %K A184980 nonn,hard,more,tabf %O A184980 9,3 %A A184980 _Jason Kimberley_, Jan 19 2012