|
Search: id:A007112
|
|
|
| A007112 |
|
Number of connected unlabeled graphs with n nodes and degree >= 3.
(Formerly M3059)
|
|
+0
3
|
|
| 0, 0, 0, 1, 3, 19, 150, 2589, 84242, 5203110, 577076528, 113373005661, 39618075274687, 24916469690421103, 28563628406172313565, 60366734880279992689057, 237406976195431811992516687
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
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 = 1..28
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
CROSSREFS
|
Row sums of A123545.
Sequence in context: A054316 A006289 A120590 this_sequence A007111 A113013 A105784
Adjacent sequences: A007109 A007110 A007111 this_sequence A007113 A007114 A007115
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
