The OEIS is supported by the many generous donors to the OEIS Foundation.



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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A241458 Number of simple connected graphs g on n nodes with |Aut(g)| = 10. 19
0, 0, 0, 0, 1, 1, 1, 3, 13, 123 (list; graph; refs; listen; history; text; internal format)



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


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: A260847 A121921 A191955 * A302861 A182864 A208590

Adjacent sequences: A241455 A241456 A241457 * A241459 A241460 A241461




Travis Hoppe and Anna Petrone, Apr 25 2014



Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 27 05:12 EST 2022. Contains 358362 sequences. (Running on oeis4.)