Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007130
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007130 Number of unlabeled rooted strength 3 Eulerian graphs with n nodes.
(Formerly M4242)
+0
1
1, 1, 6, 41, 816, 54121, 14274660, 14153665099, 51048862475458, 667165739670566962, 31770009199858957846460, 5550661350485312810140308676, 3581414124954098378653083208146076 (list; graph; listen)
OFFSET

1,3

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

R. W. Robinson, personal communication.

R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1979.

LINKS

R. W. Robinson, Table of n, a(n) for n = 1..22

CROSSREFS

Sequence in context: A006198 A167588 A113573 this_sequence A075000 A077307 A112960

Adjacent sequences: A007127 A007128 A007129 this_sequence A007131 A007132 A007133

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research