142190703

Appears in sequences

• Number of deterministic completely defined initially connected acyclic automata with 2 inputs and n transient unlabeled states (and a unique absorbing state).at n=8A082161
• Triangular matrix, read by rows, that satisfies: T(n,k) = [T^2](n-1,k) when n>k>=0, with T(n,n) = (n+1).at n=45A102086
• Triangle, read by rows, equal to the matrix inverse of A104416, where A104416(n,k) = A008275(k+1,n-k+1) (Stirling numbers of the first kind).at n=45A104417
• Triangle, read by rows, equal to the matrix inverse of A104416, where A104416(n,k) = A008275(k+1,n-k+1) (Stirling numbers of the first kind).at n=46A104417
• Triangular matrix T, read by rows, that satisfies: [T^-1](n,k) = -(k+1)*T(n-1,k) when (n-1)>=k>=0, with T(n,n) = 1 and T(n+1,n) = (n+1) for n>=0.at n=45A106208
• Triangular matrix T, read by rows, that satisfies: [T^-1](n,k) = -k^2*T(n-2,k) when (n-2)>=k>=0, with T(n,n) = 1 and T(n+1,n) = (2*n+1) for n>=0.at n=45A106210
• Triangular matrix T, read by rows, that satisfies: [T^-1](n,k) = -k^2*T(n-2,k) when (n-2)>=k>=0, with T(n,n) = 1 and T(n+1,n) = (2*n+1) for n>=0.at n=46A106210
• 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=36A128249