A241460 - OEIS

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A241460

Number of simple connected graphs g on n nodes with |Aut(g)| = 14

19

0, 0, 0, 0, 0, 0, 2, 2, 2, 6

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,7

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: A059814 A079443 A270380 * A167568 A361301 A240501

Adjacent sequences: A241457 A241458 A241459 * A241461 A241462 A241463

KEYWORD

nonn

AUTHOR

Travis Hoppe and Anna Petrone, Apr 25 2014

STATUS

approved