|
| |
|
|
A007132
|
|
Number of unlabeled connected strength 3 Eulerian graphs with n nodes, 2 of odd degree.
(Formerly M2041)
|
|
1
|
|
|
|
1, 2, 12, 120, 3400, 306016, 98563520, 112894101120, 459097587148864, 6670310734264082432, 349450667631321436169216, 66606918180477057534935269376, 46558189270683049288752313344776192
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
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, 1979.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
|
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
|
