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!)
A241840 Number of simple connected graphs on n nodes that are not distance-regular. 0
0, 0, 1, 4, 19, 108, 851, 11112, 261076, 11716564 (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

T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644, 2014

Eric Weisstein's World of Mathematics, Distance-Regular Graph

FORMULA

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

CROSSREFS

Sequence in context: A091643 A323620 A306183 * A199318 A117397 A004212

Adjacent sequences:  A241837 A241838 A241839 * A241841 A241842 A241843

KEYWORD

nonn,less

AUTHOR

Travis Hoppe and Anna Petrone, Apr 29 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 3 19:39 EST 2021. Contains 349468 sequences. (Running on oeis4.)