15646589

Appears in sequences

• Deterministic completely defined acyclic automata with 3 inputs and n+1 transient labeled states including a unique state having all transitions to the absorbing state.at n=4A082160
• A subclass of quasi-acyclic automata with 3 inputs, n transient and k absorbing labeled states.at n=14A082172
• Unreduced numerators of the elements T(n,k)/(n-k)!, read by rows, of the triangular matrix P^-1, which is the inverse of the matrix defined by P(n,k) = (1-(k+1)^3)^(n-k)/(n-k)! for n >= k >= 1.at n=10A103243