(Translated by https://www.hiragana.jp/)
A007130 - OEIS
The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007130 Number of unlabeled rooted strength 3 Eulerian graphs with n nodes.
(Formerly M4242)
1
1, 1, 6, 41, 816, 54121, 14274660, 14153665099, 51048862475458, 667165739670566962, 31770009199858957846460, 5550661350485312810140308676, 3581414124954098378653083208146076 (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
CROSSREFS
Sequence in context: A167588 A323573 A230134 * A075000 A112960 A181041
KEYWORD
nonn
AUTHOR
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 18 08:45 EDT 2024. Contains 372618 sequences. (Running on oeis4.)