%I A003400 M4575
%S A003400 1,0,0,0,0,8,152,3696,135004,7971848,805364776
%N A003400 Number of asymmetric (not necessarily connected) graphs with n nodes.
%C A003400 Number of simple graphs g on n nodes with |Aut(g)| = 1.
%D A003400 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A003400 F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 
               1973, p. 220, Section P3.4.
%D A003400 P. Steinbach, Field Guide to Simple Graphs. Design Lab, Albuquerque NM, 
               1990.
%H A003400 Klaus Brockhaus, <a href="a3400.gif">The 6-node asymmetric graphs</a>
%H A003400 Zoran Maksimovic, <a href="a075095.pdf">Number of graphs on n nodes whose 
               automorphism group orders are k, n<=11</a>
%H A003400 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               IdentityGraph.html">Identity Graph</a>
%H A003400 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               GraphAutomorphism.html">Graph Automorphism</a>
%Y A003400 See A124059 for connected asymmetric graphs. Cf. A000088.
%Y A003400 Sequence in context: A003491 A053606 A123770 this_sequence A059510 A094059 
               A113268
%Y A003400 Adjacent sequences: A003397 A003398 A003399 this_sequence A003401 A003402 
               A003403
%K A003400 nonn,nice,hard
%O A003400 1,6
%A A003400 N. J. A. Sloane (njas(AT)research.att.com).
%E A003400 a(8) and a(9) from Eric Weisstein (eric(AT)weisstein.com), Jun 09, 2004
%E A003400 a(10) and a(11) from Zoran Maksimovic, Vladeta Jovovic (vladeta(AT)eunet.rs), 
               Jan 21 2005