|
|
A003400
|
|
Number of asymmetric (not necessarily connected) graphs with n nodes.
(Formerly M4575)
|
|
14
|
|
|
1, 0, 0, 0, 0, 8, 152, 3696, 135004, 7971848, 805364776, 144123121972
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,6
|
|
COMMENTS
|
Number of simple graphs g on n nodes with |Aut(g)| = 1.
|
|
REFERENCES
|
F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 220, Section P3.4.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
Peter Steinbach, Field Guide to Simple Graphs, Volume 1, Part 17 (For Volumes 1, 2, 3, 4 of this book see A000088, A008406, A000055, A000664, respectively.)
|
|
FORMULA
|
|
|
PROG
|
(nauty/bash) for n in {1..10}; do geng -q ${n} | countg -q -a1 | grep altogether | awk '{print $1}'; done # - Sean A. Irvine, Apr 22 2015
|
|
CROSSREFS
|
Cf. A124059 (connected simple asymmetric graphs).
Cf. A275867 (disconnected simple asymmetric graphs).
|
|
KEYWORD
|
nonn,nice,hard,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|