Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A126201
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A126201
%S A126201 1,1,3,11,57,375,3398,40043,585440,9895493
%N A126201 Number of rooted connected unlabeled planar graphs on n nodes.
%C A126201 Number of "pointed" connected planar graphs on n nodes: number of pairs 
               (G,P) where G is a connected unlabeled planar graph with n nodes 
               and P runs through the orbit representatives of nodes in G under 
               the action of Aut(G).
%C A126201 For n <= 4 this agrees with A126100; a(5) = A126100(5) - 1 = 57, since 
               K_5 is the only excluded graph on 5 nodes.
%Y A126201 Cf. A005470, A039735, A126100.
%Y A126201 Sequence in context: A094611 A052442 A001586 this_sequence A020012 A126100 
               A009444
%Y A126201 Adjacent sequences: A126198 A126199 A126200 this_sequence A126202 A126203 
               A126204
%K A126201 nonn
%O A126201 1,3
%A A126201 David Applegate (david(AT)research.att.com) and N. J. A. Sloane (njas(AT)research.att.com), 
               Mar 09 2007
%E A126201 a(6)-a(10) from Brendan McKay, Mar 10 2007

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research