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 A184950 #15 May 01 2014 02:37:01 %S A184950 1,3,59,1,7847,1,3459376,7,2585136287,388,2807104844073,406824 %N A184950 Irregular triangle C(n,g) counting the connected 5-regular simple graphs on 2n vertices with girth exactly g. %C A184950 The first column is for girth exactly 3. The row length sequence starts: 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4. The row length is incremented to g-2 when 2n reaches A054760(5,g). %H A184950 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> %H A184950 Jason Kimberley, <a href="/A184950/a184950.txt">Incomplete table of i, n, g, C(n,g)=a(i) for row n = 3..22</a> %e A184950 1; %e A184950 3; %e A184950 59, 1; %e A184950 7847, 1; %e A184950 3459376, 7; %e A184950 2585136287, 388; %e A184950 2807104844073, 406824; %e A184950 ?, 1125022325; %e A184950 ?, 3813549359274; %Y A184950 Connected 5-regular simple graphs with girth at least g: A184951 (triangle); chosen g: A006821 (g=3), A058275 (g=4). %Y A184950 Connected 5-regular simple graphs with girth exactly g: this sequence (triangle); chosen g: A184953 (g=3), A184954 (g=4), A184955 (g=5). %Y A184950 Triangular arrays C(n,g) counting connected simple k-regular graphs on n vertices with girth exactly g: A198303 (k=3), A184940 (k=4), this sequence (k=5), A184960 (k=6), A184970 (k=7), A184980 (k=8). %K A184950 nonn,hard,more,tabf %O A184950 3,2 %A A184950 _Jason Kimberley_, Feb 24 2011