|
Search: id:A007125
|
|
|
| A007125 |
|
Number of connected strength-1 Eulerian graphs with n nodes, 2 of odd degree.
(Formerly M2865)
|
|
+0
2
|
|
| 0, 1, 1, 3, 10, 44, 274, 2518, 39159, 1087472, 56214536, 5422178367, 973901229150, 325367339922914, 202427527012666564, 235111320292288931449, 511328244516581761886211, 2088977518516761768744519266
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
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..26
|
|
CROSSREFS
|
Sequence in context: A113059 A000608 A009648 this_sequence A102911 A096752 A134018
Adjacent sequences: A007122 A007123 A007124 this_sequence A007126 A007127 A007128
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
