|
Search: id:A064815
|
|
|
| A064815 |
|
Related to enumeration of finite automata. |
|
+0
1
|
|
| 1, 1, 6, 60, 900, 17880, 441960, 13064400, 449386800, 17630743200, 776922300000, 37990482532800, 2041238825908800, 119537563260528000, 7577709770318352000
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
M. Domaratzki, Improved bounds on the number of automata accepting finite languages, in Computing and Combinatorics Conference: COCOON'02, Internat. J. Found. Comput. Sci. 15 (2004), 143-161.
|
|
FORMULA
|
a(n) = 2(2n-3)a(n-1) + 2(2n-5)(n-4)a(n-2) for n >= 4; a(n) = A000407(n-2) for n <=3.
|
|
CROSSREFS
|
Cf. A000407.
Sequence in context: A099708 A010040 A138379 this_sequence A126574 A061573 A092356
Adjacent sequences: A064812 A064813 A064814 this_sequence A064816 A064817 A064818
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Mike Domaratzki (mdomaratzki(AT)alumni.uwaterloo.ca), Oct 22 2001
|
|
|
Search completed in 0.002 seconds
|
