42258384

Appears in sequences

• Deterministic completely defined initially connected acyclic automata with 3 inputs and n+1 transient unlabeled states including a unique state having all transitions to the absorbing state.at n=5A082164
• Triangular matrix T, read by rows, that satisfies: T^3 + 3T^2 + 3T = SHIFTUP(T), also T^(n+2) + 3T^(n+1) + 3T^n = SHIFTUP(T^n - D*T^(n-1)) for all n, where D is a diagonal matrix with diagonal(D) = diagonal(T) = {1,2,3,...}.at n=15A103237