|
%I M5298 #27 Mar 11 2021 03:00:24
%S 49,6877,1854545,807478656,514798204147,451182323794896,
%T 519961864703259753,762210147961330421167,1384945048774500147047194,
%U 3055115321627096660341307614,8043516699726480852467167758419,24915939138210507189761922944830006
%N Number of connected n-state finite automata with 3 inputs.
%C Is this sequence essentially the same as A304313? - _Paul D. Hanna_, May 11 2018
%D Robert W. Robinson, Counting strongly connected finite automata, pages 671-685 in "Graph theory with applications to algorithms and computer science." Proceedings of the fifth international conference held at Western Michigan University, Kalamazoo, Mich., June 4-8, 1984. Edited by Y. Alavi, G. Chartrand, L. Lesniak [L. M. Lesniak-Foster], D. R. Lick and C. E. Wall. A Wiley-Interscience Publication. John Wiley & Sons, Inc., New York, 1985. xv+810 pp. ISBN: 0-471-81635-3; Math Review MR0812651 (86g:05026).
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Hugo Pfoertner, <a href="/A006692/b006692.txt">Table of n, a(n) for n = 1..30</a>
%H R. W. Robinson, <a href="/A006689/a006689_1.pdf">Counting strongly connected finite automata</a>, pages 671-685 in "Graph theory with applications to algorithms and computer science." Proceedings of the fifth international conference held at Western Michigan University, Kalamazoo, Mich., June 4-8, 1984. Edited by Y. Alavi, G. Chartrand, L. Lesniak [L. M. Lesniak-Foster], D. R. Lick and C. E. Wall. A Wiley-Interscience Publication. John Wiley & Sons, Inc., New York, 1985. xv+810 pp. ISBN: 0-471-81635-3; Math Review MR0812651. (86g:05026). [Annotated scanned copy, with permission of the author.]
%Y Cf. A027834, A006691, A304313.
%K nonn
%O 1,1
%A _N. J. A. Sloane_.
%E Extended using the PARI program by _Paul D. Hanna_ in A027834 by _Hugo Pfoertner_, May 22 2018
|
