|
Search: id:A005177
|
|
|
| A005177 |
|
Number of connected regular graphs with n nodes.
(Formerly M0347)
|
|
+0
7
|
|
| 1, 1, 1, 2, 2, 5, 4, 17, 22, 167, 539, 18979, 389436, 50314796, 2942198440, 1698517036411
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
REFERENCES
|
M. Meringer, Fast Generation of Regular Graphs and Construction of Cages. Journal of Graph Theory, 30 (1999), 137-146. [From Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Sep 23 2009]
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
P. Steinbach, Field Guide to Simple Graphs. Design Lab, Albuquerque NM, 1990.
|
|
LINKS
|
E. Friedman, Illustration of small graphs
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
Markus Meringer, GENREG: A program for Connected Regular Graphs [From Giovanni Resta (g.resta(AT)iit.cnr.it), Feb 05 2009]
|
|
CROSSREFS
|
Cf. A002851, A005176, A006820-A006822, A014377, A014378, A014381, A014382, A014384, A068932, A068934.
Row sums of triangle A068934. Inverse Euler transformation of A165647. Equals A165647 minus A165648. [From Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Sep 23 2009]
Sequence in context: A144366 A054156 A054079 this_sequence A045537 A161622 A116559
Adjacent sequences: A005174 A005175 A005176 this_sequence A005178 A005179 A005180
|
|
KEYWORD
|
nonn,nice,hard,more
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from David Wasserman (dwasserm(AT)earthlink.net), Mar 08 2002
a(15) from Giovanni Resta (g.resta(AT)iit.cnr.it), Feb 05 2009
Terms are sums of the output from M. Meringer's genreg software. To complete a(16) it was run by Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Sep 23 2009
|
|
|
Search completed in 0.002 seconds
|
