A054746 Number of nonisomorphic connected binary n-state automata without output under input permutations.
1, 6, 67, 1379, 40000, 1488212, 66468616, 3459744878, 205517092374, 13719689837415, 1016860316477931, 82855990193202263, 7361905026684383986, 708398087768889272827, 73390382551302560225067, 8144731151602797676232825, 963990026196934640329291135
Offset: 1
Keywords
Examples
There are 40000 nonisomorphic connected binary 5-state automata under input permutations.
References
- F. Harary and E. Palmer, Graphical Enumeration, 1973.
Links
- Alois P. Heinz, Table of n, a(n) for n = 1..45
- M. A. Harrison, A census of finite automata, Canad. J. Math., 17, No. 1, 1965, p. 110.
Extensions
More terms from Alois P. Heinz, Feb 20 2017
Comments