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 A088741 #26 Feb 16 2025 08:32:51
%S A088741 1,1,1,2,2,3,1,3,3,5
%N A088741 Number of connected strongly regular simple graphs on n nodes.
%H A088741 T. Hoppe and A. Petrone, <a href="http://arxiv.org/abs/1408.3644">Integer sequence discovery from small graphs</a>, arXiv preprint arXiv:1408.3644 [math.CO], 2014.
%H A088741 T. Hoppe and A. Petrone, <a href="http://doi.org/10.1016/j.dam.2015.07.017">Integer sequence discovery from small graphs</a>, Discr. Appl. Math. 201 (2016) 172-181.
%H A088741 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/StronglyRegularGraph.html">Strongly Regular Graph</a>
%e A088741 1: K_1 (1 graph)
%e A088741 2: P_2 = K_2 (1 graph)
%e A088741 3: C_3 = K_3 (1 graph)
%e A088741 4: C_4, K_4 (2 graphs)
%e A088741 5: C_5, K_5 (2 graphs)
%e A088741 6: K_6, Ci_6(1,2), K_{3,3} (3 graphs)
%e A088741 Here, Ci_n(...) a circulant graph.
%Y A088741 Cf. A005177, A076435, A294405.
%K A088741 nonn,more
%O A088741 1,4
%A A088741 _Eric W. Weisstein_, Oct 12 2003
%E A088741 a(10) from the Encyclopedia of Finite Graphs (_Travis Hoppe_ and _Anna Petrone_), Apr 11 2014