|
Search: id:A001373
|
|
|
| A001373 |
|
Functional digraphs (digraphs of functions on n nodes where every node has outdegree 1 and loops of length 1 are forbidden).
(Formerly M1597 N0623)
|
|
+0
6
|
|
| 1, 0, 1, 2, 6, 13, 40, 100, 291, 797, 2273, 6389, 18264, 51916, 148666, 425529, 1221900, 3511507, 10111043, 29142941, 84112009, 243000149, 702758065, 2034150215, 5892907566, 17084615940, 49567063847, 143902155133
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
REFERENCES
|
F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 70, Table 3.4.1.
R. C. Read, Note on number of functional digraphs, Math. Ann., vol. 143 (1961), pp. 109-111.
|
|
LINKS
|
N. J. A. Sloane, Transforms
L. Travis, [math/9811127] Graphical Enumeration: A Species-Theoretic Approach
|
|
CROSSREFS
|
Euler transform of A002862. Cf. A001372.
Sequence in context: A026550 A124124 A052450 this_sequence A057243 A012470 A056592
Adjacent sequences: A001370 A001371 A001372 this_sequence A001374 A001375 A001376
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
Sequence extended by Paul Zimmermann; more terms and better description from Christian Bower.
|
|
|
Search completed in 0.002 seconds
|
