The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #12 Jun 29 2017 08:41:08
%S 1,6,67,1379,40000,1488212,66468616,3459744878,205517092374,
%T 13719689837415,1016860316477931,82855990193202263,
%U 7361905026684383986,708398087768889272827,73390382551302560225067,8144731151602797676232825,963990026196934640329291135
%N Number of nonisomorphic connected binary n-state automata without output under input permutations.
%C Inverse Euler transform of A054745.
%D F. Harary and E. Palmer, Graphical Enumeration, 1973.
%H Alois P. Heinz, <a href="/A054746/b054746.txt">Table of n, a(n) for n = 1..45</a>
%H M. A. Harrison, <a href="http://dx.doi.org/10.4153/CJM-1965-010-9">A census of finite automata</a>, Canad. J. Math., 17, No. 1, 1965, p. 110.
%e There are 40000 nonisomorphic connected binary 5-state automata under input permutations.
%Y Cf. A054732, A027834.
%K nonn
%O 1,2
%A _Vladeta Jovovic_, Apr 22 2000
%E More terms from _Alois P. Heinz_, Feb 20 2017