A007129 Number of unlabeled strength 3 Eulerian graphs with n nodes, 2 of odd degree. (Formerly M2045)

0, 2, 12, 176, 6416, 745920, 293075904, 394099077120, 1835009281314048, 30009926711011488256, 1747146367164504269618176, 366331755173237226238282129408, 279347803170668467265962662338908160

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

R. W. Robinson, Table of n, a(n) for n = 1..22

Crossrefs

Sequence in context: A271857 A113149 A156143 * A125861 A334175 A228508

Adjacent sequences: A007126 A007127 A007128 * A007130 A007131 A007132

Keyword

nonn

Author

N. J. A. Sloane.

Status

approved