login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A316831 Trajectory of 0 under repeated application of the morphism 0 -> 01, 1 -> 21, 2 -> 13, 3 -> 33. 3
0, 1, 2, 1, 1, 3, 2, 1, 2, 1, 3, 3, 1, 3, 2, 1, 1, 3, 2, 1, 3, 3, 3, 3, 2, 1, 3, 3, 1, 3, 2, 1, 2, 1, 3, 3, 1, 3, 2, 1, 3, 3, 3, 3, 3, 3, 3, 3, 1, 3, 2, 1, 3, 3, 3, 3, 2, 1, 3, 3, 1, 3, 2, 1, 1, 3, 2, 1, 3, 3, 3, 3, 2, 1, 3, 3, 1, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Robert Israel, Table of n, a(n) for n = 0..10000

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.

MAPLE

f(0):= (0, 1):

f(1):= (2, 1):

f(2):= (1, 3):

f(3):= (3, 3):

A:= [0]:

for i from 1 to 8 do A:= map(f, A) od:

A; # Robert Israel, Jul 18 2018

MATHEMATICA

Nest[ Flatten[# /. {0 -> {0, 1}, 1 -> {2, 1}, 2 -> {1, 3}, 3 -> {3, 3}}] &, {0}, 7] (* Robert G. Wilson v, Jul 18 2018 *)

CROSSREFS

Cf. A086747, A316832.

Sequence in context: A079216 A181654 A192710 * A112380 A272121 A273135

Adjacent sequences:  A316828 A316829 A316830 * A316832 A316833 A316834

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Jul 18 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 10 11:42 EDT 2020. Contains 335576 sequences. (Running on oeis4.)