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 A184953 #24 Feb 16 2025 08:33:13 %S A184953 0,0,0,1,3,59,7847,3459376,2585136287,2807104844073 %N A184953 Number of connected 5-regular (or quintic) simple graphs on 2n vertices with girth exactly 3. %H A184953 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 A184953 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Girth.html">Girth</a>. %H A184953 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/QuinticGraph.html">Quintic Graph</a>. %F A184953 a(n) = A006821(n) - A058275(n). %Y A184953 Connected k-regular simple graphs with girth exactly 3: A006923 (k=3), A184943 (k=4), this sequence (k=5), A184963 (k=6), A184973 (k=7), A184983 (k=8), A184993 (k=9). %Y A184953 Connected 5-regular simple graphs with girth at least g: A006821 (g=3), A058275 (g=4). %Y A184953 Connected 5-regular simple graphs with girth exactly g: this sequence (g=3), A184954 (g=4), A184955 (g=5). %K A184953 nonn,more,hard %O A184953 0,5 %A A184953 _Jason Kimberley_, Feb 27 2011