|
Search: id:A082159
|
|
|
| A082159 |
|
Number of deterministic completely defined acyclic automata with 2 inputs and n+1 transient labeled states including a unique state having all transitions to the absorbing state. |
|
+0
4
|
|
| 1, 3, 39, 1206, 69189, 6416568, 881032059, 168514815360, 42934911510249, 14081311783382400, 5786296490491543599, 2914663547018935095552, 1767539279001227299807725
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
This is the first column of the array A082171.
|
|
REFERENCES
|
V. A. Liskovets, Exact enumeration of acyclic automata, Proc. 15th Conf. "Formal Power Series and Algebr. Combin. (FPSAC'03)", 2003.
|
|
LINKS
|
V. A. Liskovets, Exact enumeration of acyclic deterministic automata,Discrete Appl. Math., 154, No.3 (2006), 537-551.
|
|
FORMULA
|
a(n)=b_2(n) where b_2(0) := 1, b_2(n) := sum(binomial(n, i)*(-1)^(n-i-1)*((i+2)^2-1)^(n-i)*b_2(i), i=0..n-1), n>0.
|
|
CROSSREFS
|
Cf. A082157.
Sequence in context: A121247 A064732 A092610 this_sequence A084881 A015017 A076628
Adjacent sequences: A082156 A082157 A082158 this_sequence A082160 A082161 A082162
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Valery Liskovets (liskov(AT)im.bas-net.by), Apr 09 2003
|
|
|
Search completed in 0.002 seconds
|
