T(n,k) is the number of unlabeled acyclic single-source automata with n transient states on a (k+1)-letter input alphabet.

A128249

T(n,k) is the number of unlabeled acyclic single-source automata with n transient states on a (k+1)-letter input alphabet.

Terms

    a(0) =1a(1) =3a(2) =1a(3) =16a(4) =7a(5) =1a(6) =127a(7) =139a(8) =15a(9) =1a(10) =1363a(11) =5711a(12) =1000a(13) =31a(14) =1a(15) =18628a(16) =408354a(17) =189035a(18) =6631a(19) =63a(20) =1a(21) =311250a(22) =45605881a(23) =79278446a(24) =5470431a(25) =42196a(26) =127a(27) =1a(28) =6173791a(29) =7390305396

External references