login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A316832
In A316831, replace 2's and 3's with 0's.
1
0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 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, 1, 0, 0, 1, 0, 0, 1
OFFSET
0
LINKS
A. Cobham, On the Hartmanis-Stearns problem for a class of tag machines, 9th Annual Symposium on Switching and Automata Theory (SWAT 1968)(FOCS), pp. 51-60, 1968; doi:10.1109/SWAT.1968.20. See Example 7.
MATHEMATICA
Nest[ Flatten[# /. {0 -> {0, 1}, 1 -> {2, 1}, 2 -> {1, 3}, 3 -> {3, 3}}] &, {0}, 7] /. {2 -> 0, 3 -> 0} (* Robert G. Wilson v, Jul 18 2018 *)
CROSSREFS
Sequence in context: A347870 A188967 A090171 * A086747 A188973 A188970
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jul 18 2018
STATUS
approved