A076435 Number of strongly regular simple graphs on n nodes.
1, 2, 2, 4, 3, 6, 2, 6, 5, 8, 2, 10, 3, 6
Offset: 1
Examples
1: K_1 (1 graph)
2: \bar K_2, P_2 = K_2 (2 graph)
3: \bar K_3, C_3 = K_3 (2 graphs)
4: \bar K_4, 2P_2, C_4, K_4 (4 graphs)
5: C_5, \bar K_5, K_5 (3 graphs)
6: 2C_3, K_6, \bar K_6, 3P_2, Ci_6(1,2), K_{3,3} (6 graphs)
Here, \bar denotes the graph complement and Ci_n(...) a circular graph.
Links
- Eric Weisstein's World of Mathematics, Strongly Regular Graph
Extensions
a(10) from Eric W. Weisstein, Oct 30 2017
a(11)-a(14) from Sean A. Irvine, Sep 11 2021