|
Search: id:A007128
|
|
|
| A007128 |
|
Number of unlabeled strength 3 Eulerian graphs with n nodes.
(Formerly M1884)
|
|
+0
1
|
|
| 1, 2, 8, 50, 872, 55056, 14330784, 14168055824, 51063045165248, 667216816957658368, 31770676467810344050944, 5550693121829253260986015232, 3581419675678994222257101230830592, 8583524017313906693161883558288460677120
(list; graph; listen)
|
|
|
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.
|
|
LINKS
|
R. W. Robinson, Table of n, a(n) for n = 1..22
|
|
CROSSREFS
|
Adjacent sequences: A007125 A007126 A007127 this_sequence A007129 A007130 A007131
Sequence in context: A007334 A110083 A086922 this_sequence A013085 A059429 A018987
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
