login
This site is supported by donations to The OEIS Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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; text; 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: A259352 A205803 A009648 * A247053 A102911 A096752

Adjacent sequences:  A007122 A007123 A007124 * A007126 A007127 A007128

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 January 18 16:40 EST 2019. Contains 319271 sequences. (Running on oeis4.)