A241465 Number of simple connected graphs g on n nodes with |Aut(g)| = 48.

0, 0, 0, 0, 0, 4, 14, 65, 504, 5215

Offset

1,6

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, Graph Automorphism

Crossrefs

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.

Sequence in context: A081891 A119857 A305654 * A320488 A126787 A187742

Adjacent sequences: A241462 A241463 A241464 * A241466 A241467 A241468

Keyword

nonn,hard,more

Author

Travis Hoppe and Anna Petrone, Apr 25 2014

Status

approved