|
Search: id:A007124
|
|
|
| A007124 |
|
Number of strength 1 Eulerian graphs with n nodes, 2 of odd degree.
(Formerly M1494)
|
|
+0
1
|
|
| 0, 1, 2, 5, 16, 62, 344, 2888, 42160, 1130244, 57349936, 5479605296, 979383162528, 326346868386848, 202753892253143616, 235314078797344415360, 511563560865769179773568, 2089489084248273187063929888
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
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
|
R. W. Robinson, Table of n, a(n) for n = 1..26
|
|
CROSSREFS
|
Sequence in context: A157314 A159603 A058117 this_sequence A112951 A124470 A105072
Adjacent sequences: A007121 A007122 A007123 this_sequence A007125 A007126 A007127
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
