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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007124 Number of strength 1 Eulerian graphs with n nodes, 2 of odd degree.
(Formerly M1494)
1
0, 1, 2, 5, 16, 62, 344, 2888, 42160, 1130244, 57349936, 5479605296, 979383162528, 326346868386848, 202753892253143616, 235314078797344415360, 511563560865769179773568, 2089489084248273187063929888 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

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: A157314 A159603 A058117 * A112951 A124470 A105072

Adjacent sequences:  A007121 A007122 A007123 * A007125 A007126 A007127

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 22 09:52 EST 2019. Contains 319363 sequences. (Running on oeis4.)