|
| |
|
|
A094912
|
|
a(n) = output produced by a finite automaton when fed binary representation of n, read from right to left.
|
|
0
| |
|
|
0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| There are 3 states. Start in state A.
If in A and 0 arrives go to A
If in A and 1 arrives go to B
If in B and 0 arrives go to C
If in B and 1 arrives go to A
If in C and 0 arrives go to A
If in C and 1 arrives go to C
If end in A, B, C then output 0, 0, 1 respectively.
|
|
|
LINKS
| J.-P. Allouche and M. Mendes France, Automata and Automatic Sequences, see example, pages 12-13.
|
|
|
EXAMPLE
| a(10) = 1: 10 = 1010, read from right: A->A->B->C, so output a 1.
|
|
|
PROG
| (PARI) {m=104; for(n=0, m, tape=binary(n); d=length(tape); state="A"; for(j=0, d-1, in=tape[d-j];
state=if(state=="A", if(in==0, "A", "B"), if(state=="B", if(in==0, "C", "A"), if(in==0, "A", "C"))));
print1(if(state=="A"||state=="B", 0, 1), ", "))} - Klaus Brockhaus, Jun 23 2004
|
|
|
CROSSREFS
| Sequence in context: A093958 A044936 A133944 * A103673 A028862 A011673
Adjacent sequences: A094909 A094910 A094911 * A094913 A094914 A094915
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Jun 21 2004
|
|
|
EXTENSIONS
| A very interesting paper. I only looked though it as far as page 12. Perhaps some reader would read to the end and add appropriate references to it from other entries in the OEIS, as well as adding any new sequences that are found. A similar remark could be made about many papers on Jean-Paul Allouche's web site. - N. J. A. Sloane (njas(AT)research.att.com).
More terms from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jun 23 2004
|
| |
|
|
