cp's OEIS Frontend

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.

A076435 Number of strongly regular simple graphs on n nodes.

This page as a plain text file.
%I A076435 #22 Feb 16 2025 08:32:47
%S A076435 1,2,2,4,3,6,2,6,5,8,2,10,3,6
%N A076435 Number of strongly regular simple graphs on n nodes.
%H A076435 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/StronglyRegularGraph.html">Strongly Regular Graph</a>
%e A076435 1: K_1 (1 graph)
%e A076435 2: \bar K_2, P_2 = K_2 (2 graph)
%e A076435 3: \bar K_3, C_3 = K_3 (2 graphs)
%e A076435 4: \bar K_4, 2P_2, C_4, K_4 (4 graphs)
%e A076435 5: C_5, \bar K_5, K_5 (3 graphs)
%e A076435 6: 2C_3, K_6, \bar K_6, 3P_2, Ci_6(1,2), K_{3,3} (6 graphs)
%e A076435 Here, \bar denotes the graph complement and Ci_n(...) a circular graph.
%Y A076435 Cf. A005176, A076434, A088741.
%K A076435 nonn,nice,more
%O A076435 1,2
%A A076435 _Eric W. Weisstein_, Oct 11 2002
%E A076435 a(10) from _Eric W. Weisstein_, Oct 30 2017
%E A076435 a(11)-a(14) from _Sean A. Irvine_, Sep 11 2021