|
%I #9 Sep 14 2014 22:59:55
%S 0,0,0,0,0,0,2,6,29,199
%N Number of simple connected graphs g on n nodes with |Aut(g)| = 20
%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/GraphAutomorphism.html">Graph Automorphism</a>
%Y Cf. Values of |Aut(g)| for simple connected graphs, A124059, A241454, A241455, A241456, A241457, A241458, A241459, A241460, A241461, A241462, A241463, A241464, A241465, A241466, A241467, A241468, A241469, A241470, A241471.
%K nonn
%O 1,7
%A _Travis Hoppe_ and _Anna Petrone_, Apr 25 2014
|
