%I
%S 1,1,1,2,2,4,2,5,4,7
%N Number of distanceregular simple connected graphs on n nodes.
%C Since the smallest distanceregular graph that is not distancetransitive is the Shrikhande graph with 16 vertices (Brouwer et al. 1989, p. 136), this counts distance transitive graphs up to and including a(15).
%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>
%K nonn,hard,more
%O 1,4
%A _Travis Hoppe_ and _Anna Petrone_, Apr 29 2014
