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