login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A054748
Number of inequivalent n-state 1-input n-output automata.
2
1, 6, 29, 209, 1652, 15981, 171837, 2060481, 26951143, 381398614, 5789262973, 93674732887, 1607249998772, 29114205685585, 554699253112833, 11079840198856480, 231366880421810416, 5038182952520057443, 114152394913959017721, 2685768694808159100283
OFFSET
1,2
REFERENCES
F. Harary and E. Palmer, Graphical Enumeration, 1973.
LINKS
M. A. Harrison, A census of finite automata, Canad. J. Math., 17, No. 1, 1965, 100-113.
Sean A. Irvine, Java program (github)
FORMULA
Euler transform of A054749.
CROSSREFS
Sequence in context: A020090 A020036 A294312 * A209112 A205811 A143563
KEYWORD
nonn
AUTHOR
Vladeta Jovovic, Apr 22 2000
EXTENSIONS
More terms from Sean A. Irvine, Feb 21 2022
STATUS
approved