|
Search: id:A007127
|
|
|
| A007127 |
|
Number of unlabeled strength 2 Eulerian graphs with n nodes.
(Formerly M1517)
|
|
+0
2
|
|
| 1, 2, 5, 18, 100, 1242, 43425, 4925635, 1678993887, 1613875721946, 4293014800909806, 31574944534364259507, 644483327087699659771857, 36676558984788056550610362834, 5846161177591490590945591554686844, 2621219060849255874034814155021919844156
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
R. W. Robinson, personal communication.
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1980.
|
|
CROSSREFS
|
Extended by njas from Robinson's table, Oct 20 2006
Sequence in context: A058119 A075634 A084554 this_sequence A005639 A093730 A007769
Adjacent sequences: A007124 A007125 A007126 this_sequence A007128 A007129 A007130
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
