A007124 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A007124

Number of strength 1 Eulerian graphs with n nodes, 2 of odd degree.
(Formerly M1494)

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

Adjacent sequences: A007121 A007122 A007123 * A007125 A007126 A007127

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

STATUS

approved