This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A082169 Deterministic completely defined quasi-acyclic automata with 2 inputs, n transient and k absorbing labeled states. 5
 1, 1, 1, 1, 4, 7, 1, 9, 56, 142, 1, 16, 207, 1780, 5941, 1, 25, 544, 9342, 103392, 428856, 1, 36, 1175, 32848, 709893, 9649124, 47885899, 1, 49, 2232, 91150, 3142528, 82305144, 1329514816, 7685040448, 1, 64, 3871, 215892, 10682325, 440535696 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS Array read by antidiagonals: (0,1),(0,2),(1,1),(0,3),... The first column is A082157. 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)=T_2(n, k) where T_2(0, k) := 1, T_2(n, k) := sum(binomial(n, i)*(-1)^(n-i-1)*(i+k)^(2*n-2*i)*T_2(i, k), i=0..n-1), n>0; EXAMPLE The array begins: 1 1 1 1 1 1 1 1 1 - k=0 1 4 9 16 25 36 49 64 81 - k=1 7 56 207 544 1175 2232 3871 6272 9639 - k=2 CROSSREFS Cf. A082161. Sequence in context: A198347 A019670 A093436 * A209634 A289523 A078220 Adjacent sequences:  A082166 A082167 A082168 * A082170 A082171 A082172 KEYWORD easy,nonn,tabl AUTHOR Valery A. Liskovets, Apr 09 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 18 17:07 EST 2018. Contains 318240 sequences. (Running on oeis4.)