login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007129 Number of unlabeled strength 3 Eulerian graphs with n nodes, 2 of odd degree.
(Formerly M2045)
1
0, 2, 12, 176, 6416, 745920, 293075904, 394099077120, 1835009281314048, 30009926711011488256, 1747146367164504269618176, 366331755173237226238282129408, 279347803170668467265962662338908160 (list; graph; refs; listen; history; text; internal format)
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 A228508 A156516

Adjacent sequences:  A007126 A007127 A007128 * A007130 A007131 A007132

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 5 10:33 EDT 2020. Contains 333239 sequences. (Running on oeis4.)