198581

Appears in sequences

• Number of deterministic completely defined acyclic automata with 3 inputs and n transient labeled states (and a unique absorbing state).at n=4A082158
• Deterministic completely defined quasi-acyclic automata with 3 inputs, n transient and k absorbing labeled states.at n=14A082170
• 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) = (-k^3)^(n-k)/(n-k)! for n >= k >= 1.at n=10A103241
• Smith numbers of order 4.at n=17A178193
• Number of (n+1)X(n+1) 0..4 arrays with each row and column divisible by 7, read as a base-5 number with top and left being the most significant digits.at n=2A263550
• Number of (n+1)X(3+1) 0..4 arrays with each row and column divisible by 7, read as a base-5 number with top and left being the most significant digits.at n=2A263553
• T(n,k)=Number of (n+1)X(k+1) 0..4 arrays with each row and column divisible by 7, read as a base-5 number with top and left being the most significant digits.at n=12A263558