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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #11 Nov 02 2017 23:08:33
%S 0,0,0,0,0,0,1,12,180,2928
%N Number of simple connected graphs on n nodes with diameter 6
%H Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">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/GraphDiameter.html">Graph Diameter</a>
%Y Column k=6 of A294522.
%Y Cf. simple connected graph of diameter k A241706, A241707, A241708, A241709, A241710.
%K nonn,hard,more
%O 1,8
%A _Travis Hoppe_ and _Anna Petrone_, Apr 27 2014