|
Search: id:A082171
|
|
|
| A082171 |
|
A subclass of quasi-acyclic automata with 2 inputs, n transient and k absorbing labeled states. |
|
+0
5
|
|
| 1, 1, 3, 1, 8, 39, 1, 15, 176, 1206, 1, 24, 495, 7784, 69189, 1, 35, 1104, 29430, 585408, 6416568, 1, 48, 2135, 84600, 2791125, 67481928, 881032059, 1, 63, 3744, 204470, 9841728, 389244600, 11111547520, 168514815360, 1, 80, 6111, 437616, 28569765
(list; table; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Array read by antidiagonals: (0,1),(0,2),(1,1),(0,3),... The first column is A082159.
|
|
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
|
T(n, k)=S_2(n, k) where S_2(0, k) := 1, S_2(n, k) := sum(binomial(n, i)*(-1)^(n-i-1)*((i+k+1)^2-1)^(n-i)*S_2(i, k), i=0..n-1), n>0.
|
|
EXAMPLE
|
The array begins:
1 1 1 1 1 1 1 1 1 - k=0
3 8 15 24 35 48 63 80 99 - k=1
39 176 495 1104 2135 3744 6111 9440 13959 - k=2
|
|
CROSSREFS
|
Cf. A082163, A082169.
Sequence in context: A077108 A075847 A049967 this_sequence A164795 A070894 A090261
Adjacent sequences: A082168 A082169 A082170 this_sequence A082172 A082173 A082174
|
|
KEYWORD
|
easy,nonn,tabl
|
|
AUTHOR
|
Valery Liskovets (liskov(AT)im.bas-net.by), Apr 09 2003
|
|
|
Search completed in 0.002 seconds
|
