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 A184983 #15 Jan 27 2020 03:55:11
%S A184983 0,0,0,0,0,0,0,0,0,1,1,6,94,10786,3459386,1470293676,733351105934
%N A184983 Number of connected 8-regular simple graphs on n vertices with girth exactly 3.
%H A184983 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>
%F A184983 a(n) = A014378(n) - A181154(n).
%e A184983 a(0)=0 because even though the null graph (on zero vertices) is vacuously 8-regular and connected, since it is acyclic, it has infinite girth.
%e A184983 The a(9)=1 complete graph on 9 vertices is 8-regular; it has 36 edges and 84 triangles.
%t A184983 A[s_Integer] := With[{s6 = StringPadLeft[ToString[s], 6, "0"]}, Cases[ Import["https://oeis.org/A" <> s6 <> "/b" <> s6 <> ".txt", "Table"], {_, _}][[All, 2]]];
%t A184983 A014378 = A@014378;
%t A184983 A181154 = A@181154;
%t A184983 a[n_] := A014378[[n + 1]] - A181154[[n + 1]];
%t A184983 a /@ Range[0, 16] (* _Jean-François Alcover_, Jan 27 2020 *)
%Y A184983 Connected 8-regular simple graphs with girth at least g: A014378 (g=3), A181154 (g=4).
%Y A184983 Connected 8-regular simple graphs with girth exactly g: this sequence (g=3).
%K A184983 nonn,hard,more
%O A184983 0,12
%A A184983 _Jason Kimberley_, Feb 28 2011