|
Search: id:A007132
|
|
|
| A007132 |
|
Number of unlabeled connected strength 3 Eulerian graphs with n nodes, 2 of odd degree.
(Formerly M2041)
|
|
+0
1
|
|
| 1, 2, 12, 120, 3400, 306016, 98563520, 112894101120, 459097587148864, 6670310734264082432, 349450667631321436169216, 66606918180477057534935269376, 46558189270683049288752313344776192
(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).
R. W. Robinson, personal communication.
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1979.
|
|
LINKS
|
R. W. Robinson, Table of n, a(n) for n = 1..22
|
|
CROSSREFS
|
Cf. A007131, A007133, A007125.
Sequence in context: A047793 A048800 A052738 this_sequence A138534 A062080 A165300
Adjacent sequences: A007129 A007130 A007131 this_sequence A007133 A007134 A007135
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Sep 10 2002
|
|
|
Search completed in 0.002 seconds
|
