0,3
Analogous to A082161 and A082162, this describes the deterministic completely defined initially connected acyclic automata with 4 inputs and n transient unlabeled states (and a unique absorbing state) with a(0)=1.
Table of n, a(n) for n=0..12.
(PARI) {a(n)=local(A=matrix(1, 1), B); A[1, 1]=1; for(m=2, n+1, B=matrix(m, m); for(i=1, m, for(j=1, i, if(j==i, B[i, j]=j, if(j==1, B[i, j]=(A^4)[i-1, 1], B[i, j]=(A^4)[i-1, j])); )); A=B); return(A[n+1, 1])}
Cf. A102101, A082161, A082162.
Sequence in context: A103639 A055413 A067408 * A196569 A019282 A082158
Adjacent sequences: A102099 A102100 A102101 * A102103 A102104 A102105
nonn
Paul D. Hanna, Dec 29 2004
approved
