login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A293207 Lexicographically earliest sequence of positive terms such that the function f defined by f(n) = Sum_{k=1..n} (i^k * a(k)) for any n >= 0 is injective (where i denotes the imaginary unit), and a(n) != a(n+1) and a(n) != a(n+2) for any n > 0. 4

%I #18 Jul 27 2023 17:30:31

%S 1,2,3,1,2,3,1,2,3,1,2,4,1,2,4,1,2,3,1,4,5,1,7,2,1,4,2,1,4,5,1,2,3,1,

%T 2,6,3,1,4,2,1,9,2,1,3,2,1,11,2,1,6,2,1,3,2,1,6,4,7,1,3,2,1,3,9,1,2,3,

%U 1,4,7,5,1,2,4,1,11,4,10,1,9,2,6,7,1,9

%N Lexicographically earliest sequence of positive terms such that the function f defined by f(n) = Sum_{k=1..n} (i^k * a(k)) for any n >= 0 is injective (where i denotes the imaginary unit), and a(n) != a(n+1) and a(n) != a(n+2) for any n > 0.

%C See A293208 for the real part of f(n).

%C See A293209 for the imaginary part of f(n).

%C For any m > 0, let b_m be the lexicographically earliest sequence of positive terms such that the function f_m defined by f_m(n) = Sum_{k=1..n} (i^k * b_m(k)) for any n >= 0 is injective, and #{b_m(n), ..., b_m(n+m)} = m+1 for any n > 0:

%C - in particular, b_2 = a (this sequence) and f_2 = f,

%C - the representation of f shows an apparently chaotic initial phase followed by the emergence of a regular oscillating escape (see representations in Links section),

%C - the cases m=8 and m=12 have similarities with Langton's ant: the representation of f_m shows an apparently chaotic initial phase followed by the emergence of a regular escape (see representations in Links section),

%C - for the cases m=3, m=7, m=11 and m=15: b_m is m+1 periodic and b_m(n) = n for any n <= m+1,

%C - for the cases m=4, m=5, m=6, m=9, m=10, m=13, m=14 and m=16: the representation of f_m shows an apparently chaotic initial phase; it is unknown whether a regular escape emerges (see representation in Links section).

%C More informally, the sequence can be obtained with the following procedure:

%C - start at the origin, looking to the north,

%C - repeatedly: jump forward to the nearest non-visited square (provided that the jump length is distinct from the two previous jump lengths) and turn 90 degrees to the left,

%C - a(n) = length of n-th jump and f(n-1) = position before n-th jump as a Gaussian integer.

%H Rémy Sigrist, <a href="/A293207/b293207.txt">Table of n, a(n) for n = 1..60000</a>

%H Rémy Sigrist, <a href="/A293207/a293207.png">Representation of f(n) for n=0..60000</a>

%H Rémy Sigrist, <a href="/A293207/a293207_1.png">Representation of f_8(n) for n=0..121346</a>

%H Rémy Sigrist, <a href="/A293207/a293207_2.png">Representation of f_12(n) for n=0..4463502</a>

%H Rémy Sigrist, <a href="/A293207/a293207_3.png">Representation of f_6(n) for n=0..10000000</a>

%H Rémy Sigrist, <a href="/A293207/a293207.gp.txt">PARI program for A293207</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Langton%27s_ant">Langton's ant</a>

%F a(56948 + 8*k + i) = (1-k) * a(56948 + i) + k * a(56948 + i + 8) for any k >= 0 and i in 0..7.

%e f(0) = 0

%e i^1 = i.

%e f(0) + 1*i has not yet been visited; hence a(1) = 1 and f(1) = i.

%e i^2 = -1.

%e f(1) + 1*-1 has not yet been visited, but a(1) = 1.

%e f(1) + 2*-1 has not yet been visited; hence a(2) = 2 and f(2) = -2 + i.

%e i^3 = -i.

%e f(2) + 1*-i has not yet been visited, but a(1) = 1.

%e f(2) + 2*-i has not yet been visited, but a(2) = 2.

%e f(2) + 3*-i has not yet been visited; hence a(3) = 3 and f(3) = -2 - 2*i.

%e i^4 = 1.

%e f(3) + 1*1 has not yet been visited; hence a(4) = 1 and f(4) = -1 - 2*i.

%e i^5 = i.

%e f(4) + 1*i has not yet been visited, but a(4) = 1.

%e f(4) + 2*i has not yet been visited; hence a(5) = 2 and f(5) = -1.

%e i^6 = -1.

%e f(5) + 1*-1 has not yet been visited, but a(4) = 1.

%e f(5) + 2*-1 has not yet been visited, but a(5) = 2.

%e f(5) + 3*-1 has not yet been visited; hence a(6) = 3 and f(6) = -4.

%e i^7 = -i.

%e f(6) + 1*-i has not yet been visited; hence a(7) = 1 and f(7) = -4 - i.

%e i^8 = 1.

%e f(7) + 1*1 has not yet been visited, but a(7) = 1.

%e f(7) + 2*1 has not yet been visited; hence a(8) = 2 and f(8) = -2 - i.

%e i^9 = i.

%e f(8) + 1*i has not yet been visited, but a(7) = 1.

%e f(8) + 2*i has not yet been visited, but a(8) = 2.

%e f(8) + 3*i has not yet been visited; hence a(9) = 3 and f(9) = -2 + 2*i.

%e i^10 = -1.

%e f(9) + 1*-1 has not yet been visited; hence a(10) = 1 and f(10) = -3 + 2*i.

%o (PARI) See Links section.

%Y See A293208, A293209.

%K nonn

%O 1,2

%A _Rémy Sigrist_, Oct 02 2017

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)