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!)
A007128 Number of unlabeled strength 3 Eulerian graphs with n nodes.
(Formerly M1884)
1
1, 2, 8, 50, 872, 55056, 14330784, 14168055824, 51063045165248, 667216816957658368, 31770676467810344050944, 5550693121829253260986015232, 3581419675678994222257101230830592, 8583524017313906693161883558288460677120 (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: A296366 A110083 A086922 * A013085 A277506 A059429

Adjacent sequences:  A007125 A007126 A007127 * A007129 A007130 A007131

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 May 6 00:41 EDT 2021. Contains 343579 sequences. (Running on oeis4.)