|
|
A005176
|
|
Number of regular graphs with n unlabeled nodes.
(Formerly M0303)
|
|
43
|
|
|
1, 1, 2, 2, 4, 3, 8, 6, 22, 26, 176, 546, 19002, 389454, 50314870, 2942198546, 1698517037030, 442786966117636, 649978211591622812, 429712868499646587714, 2886054228478618215888598, 8835589045148342277802657274, 152929279364927228928025482936226, 1207932509391069805495173417972533120, 99162609848561525198669168653641835566774
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
REFERENCES
|
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
|
|
|
CROSSREFS
|
Not necessarily connected simple regular graphs: A005176 (any degree), A051031 (triangular array), specified degree k: A000012 (k=0), A059841 (k=1), A008483 (k=2), A005638 (k=3), A033301 (k=4), A165626 (k=5), A165627 (k=6), A165628 (k=7), A180260 (k=8).
Simple regular graphs of any degree: A005177 (connected), A068932 (disconnected), this sequence (not necessarily connected).
|
|
KEYWORD
|
nonn,nice,hard
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|