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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A243241 Number of connected simple graphs on n nodes that are not strongly regular. 0
0, 0, 1, 4, 19, 109, 852, 11114, 261077, 11716566 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Table of n, a(n) for n=1..10.

Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs

Eric Weisstein's World of Mathematics, Strongly Regular Graph

FORMULA

a(n) = A001349(n) - A088741(n).

CROSSREFS

Sequence in context: A199318 A117397 A004212 * A060905 A304473 A174123

Adjacent sequences:  A243238 A243239 A243240 * A243242 A243243 A243244

KEYWORD

nonn,more

AUTHOR

Travis Hoppe and Anna Petrone, Jun 01 2014

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 1 14:10 EST 2021. Contains 349430 sequences. (Running on oeis4.)