The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A076435 Number of strongly regular simple graphs on n nodes. 3
 1, 2, 2, 4, 3, 6, 2, 6, 5, 8 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Eric Weisstein's World of Mathematics, Strongly Regular Graph EXAMPLE 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. CROSSREFS Cf. A005176, A076434, A088741. Sequence in context: A324655 A275735 A328835 * A257010 A156864 A059975 Adjacent sequences:  A076432 A076433 A076434 * A076436 A076437 A076438 KEYWORD nonn,more AUTHOR Eric W. Weisstein, Oct 11 2002 EXTENSIONS a(10) from Eric W. Weisstein, Oct 30 2017 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 19 00:04 EDT 2021. Contains 345125 sequences. (Running on oeis4.)