408354

Appears in sequences

• Number of deterministic completely defined initially connected acyclic automata with 3 inputs and n transient unlabeled states (and a unique absorbing state).at n=4A082162
• Triangular matrix, read by rows, that satisfies: T(n,k) = [T^3](n-1,k) when n>k>=0, with T(n,n) = (n+1).at n=15A102098
• Triangle, read by rows, where T(n,k) = Sum_{j=0..k} T(n-1,j)*(j+1)*[(k+1)*(k+2)/2 - j*(j+1)/2] for n>k>0, with T(0,0)=1 and T(n,n) = T(n,n-1) for n>0.at n=19A102400
• Triangle, read by rows, where T(n,k) = Sum_{j=0..k} T(n-1,j)*(j+1)*[(k+1)*(k+2)/2 - j*(j+1)/2] for n>k>0, with T(0,0)=1 and T(n,n) = T(n,n-1) for n>0.at n=20A102400
• Column 0 of triangle A102916.at n=10A102917
• T(n,k) is the number of unlabeled acyclic single-source automata with n transient states on a (k+1)-letter input alphabet.at n=16A128249