A290884 Let S be the sequence generated by these rules: 0 is in S, and if z is in S, then z * (1+i) and (z-1) * (1+i) + 1 are in S (where i denotes the imaginary unit), and duplicates are deleted as they occur; a(n) = the real part of the n-th term of S.
0, 0, 1, 1, 2, 2, 3, 3, 2, 2, 3, 3, 4, 4, 5, 5, 0, 0, 1, 1, 2, 2, 3, 3, 2, 2, 3, 3, 4, 4, 5, 5, -4, -4, -3, -3, -2, -2, -1, -1, -2, -2, -1, -1, 0, 0, 1, 1, -4, -4, -3, -3, -2, -2, -1, -1, -2, -2, -1, -1, 0, 0, 1, 1, -8, -8, -7, -7, -6, -6, -5, -5, -6, -6, -5
Offset: 1
Examples
Let f be the function z -> z * (1+i), and g the function z -> (z-1) * (1+i) + 1. S(1) = 0 by definition; so a(1) = 0. f(S(1)) = 0 has already occurred. g(S(1)) = -i has not yet occurred; so S(2) = -i and a(2) = 0. f(S(2)) = 1 - i has not yet occurred; so S(3) = 1 - i and a(3) = 1. g(S(2)) = 1 - 2*i has not yet occurred; so S(4) = 1 - 2*i and a(4) = 1. f(S(3)) = 2 has not yet occurred; so S(5) = 2 and a(5) = 2. g(S(3)) = 2 - i has not yet occurred; so S(6) = 2 - i and a(6) = 2. f(S(4)) = 3 - i has not yet occurred; so S(7) = 3 - i and a(7) = 3. g(S(4)) = 3 - 2*i has not yet occurred; so S(8) = 3 - 2*i and a(8) = 3.
Links
- Rémy Sigrist, Table of n, a(n) for n = 1..10000
- Rémy Sigrist, Representation of the first 100000 terms of S in the complex plane
- Rémy Sigrist, Colorized representation of the first 100000 terms of S in the complex plane
- Rémy Sigrist, Colorized representation of the first 1000000 terms of S in the complex plane
- Rémy Sigrist, Colorized representation of the first 100000 terms of S' in the complex plane
- Rémy Sigrist, PARI program for A290884
- Wikipedia, Dragon curve
- Wikipedia, Twindragon
Programs
-
PARI
See Links section.
-
PARI
a(n) = imag(subst(Pol(binary(n-1)),'x,I+1)); \\ Kevin Ryde, Apr 04 2020
Comments