|
Search: id:A007111
|
|
|
| A007111 |
|
Number of unlabeled graphs with n nodes and degree >= 3.
(Formerly M3060)
|
|
+0
2
|
|
| 0, 0, 0, 0, 1, 3, 19, 150, 2590, 84245, 5203135, 577076735, 113373008891, 39618075369549, 24916469695937480, 28563628406766988588, 60366734880395211775791, 237406976195471782149927759, 1750330442243458287054664072364
(list; graph; listen)
|
|
|
OFFSET
|
0,6
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
R. W. Robinson, personal communication.
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976.
|
|
LINKS
|
R. W. Robinson, Table of n, a(n) for n = 0..28
|
|
CROSSREFS
|
Sequence in context: A006289 A120590 A007112 this_sequence A113013 A105784 A077046
Adjacent sequences: A007108 A007109 A007110 this_sequence A007112 A007113 A007114
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
