|
Search: id:A007133
|
|
|
| A007133 |
|
Number of unlabeled rooted connected strength 3 Eulerian graphs with n nodes.
(Formerly M4659)
|
|
+0
2
|
|
| 1, 1, 9, 101, 3223, 301597, 98198291, 112780875113, 458970424333059, 6669800460126763729, 349443329644003900650627, 66606536952459989434239085385, 46558117112722258272139140469354603
(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
|
Adjacent sequences: A007130 A007131 A007132 this_sequence A007134 A007135 A007136
Sequence in context: A060150 A103461 A101563 this_sequence A083452 A081461 A110698
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
