Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A095348
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A095348 Number of distinct automorphism group orders for the simple graphs on n nodes. +0
1
1, 1, 2, 5, 8, 14, 19, 30, 45, 62, 81 (list; graph; listen)
OFFSET

1,3

COMMENT

It would also be interesting to have the sequence giving the number of different permutation groups arising in this way (not just the distinct orders). - N. J. A. Sloane (njas(AT)research.att.com), Jun 04 2004

LINKS

Zoran Maksimovic, Number of graphs on n nodes whose automorphism group orders are k, n<=11

Eric Weisstein's World of Mathematics, Graph Automorphism

CROSSREFS

Sequence in context: A009238 A009203 A111711 this_sequence A022907 A006918 A165189

Adjacent sequences: A095345 A095346 A095347 this_sequence A095349 A095350 A095351

KEYWORD

nonn,more

AUTHOR

Eric Weisstein (eric(AT)weisstein.com), Jun 03, 2004

EXTENSIONS

a(8) and a(9) from Eric Weisstein (eric(AT)weisstein.com), Jun 06, 2004

a(10) and a(11) from Zoran Maksimovic, Vladeta Jovovic (vladeta(AT)eunet.rs), Jan 21 2005

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research