A241840 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

Cf. A001349, A241814.

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