%I
%S 0,0,1,4,19,108,851,11112,261076,11716564
%N Number of simple connected graphs on n nodes that are not distanceregular.
%H Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/EncyclopediaofFiniteGraphs">Encyclopedia of Finite Graphs</a>
%H T. Hoppe and A. Petrone, <a href="http://arxiv.org/abs/1408.3644">Integer sequence discovery from small graphs</a>, arXiv preprint arXiv:1408.3644, 2014
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/DistanceRegularGraph.html">DistanceRegular Graph</a>
%F a(n) = A001349(n)  A241814(n).
%K nonn,less
%O 1,4
%A _Travis Hoppe_ and _Anna Petrone_, Apr 29 2014
