|
Search: id:A005176
|
|
|
| A005176 |
|
Number of regular graphs with n nodes.
(Formerly M0303)
|
|
+0
12
|
|
| 1, 2, 2, 4, 3, 8, 6, 22, 26, 176, 546, 19002, 389454, 50314870, 2942198546, 1698517037030
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
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.
|
|
FORMULA
|
a(n) = A005177(n) + A068932(n). - David Wasserman (dwasserm(AT)earthlink.net), Mar 08 2002
|
|
CROSSREFS
|
Cf. A005177, A051031, A068932.
Row sums of triange A051031. [From Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Sep 25 2009]
Sequence in context: A006799 A056429 A133806 this_sequence A050335 A140860 A019681
Adjacent sequences: A005173 A005174 A005175 this_sequence A005177 A005178 A005179
|
|
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
Terms a(15) and a(16) were appended by Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Sep 25 2009
|
|
|
Search completed in 0.002 seconds
|
