A007131 Number of unlabeled connected strength 3 Eulerian graphs with n nodes. (Formerly M1990)

0, 2, 10, 162, 6218, 739198, 292320730, 393805101318, 1834614855993394, 30008091277676005830, 1747116355298560745383906, 366330007995516101568779931526, 279347436837102450848968821962591698

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: A076659 A197313 A294352 * A126449 A328812 A126451

Adjacent sequences: A007128 A007129 A007130 * A007132 A007133 A007134

Keyword

nonn,nice

Author

N. J. A. Sloane

Status

approved