A369989 Infinite word formed by expanding terms of A372257 by the map h : 0 -> {1,0,1}, 1 -> {1,0,0,1}, 2 -> {1,0,0,0,1}, 3 -> {1,0,0,0,0,1}.

1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0

Offset

0

Comments

This is word "y" of Berstel et al.

They construct this sequence (and A372258 "z") as an example infinite word of 2 symbols which is uniformly recurrent, has subwords closed under reversal, but only has a finite set of palindrome subwords.

There are 24 palindrome subwords and they can be found using Berstel et al's proof that it's enough to look in all h(T) where T is a length 3 subword occurring in A372257.

Blocks of 18 terms a(18*i,...,18*i+17) can be calculated from blocks of 4 terms A372257(4*i,...,4*i+3) since the latter are 0,1 or 1,0 then 2,3 or 3,2 (by the construction there), and so always expand to 18 terms under h.

This is a morphic sequence, meaning a symbol to symbol mapping of the fixed point of a morphism (for instance a uniform morphism based on the bits of n and how they result in remainder n mod 18 and bits of the corresponding quotient).

Links

Kevin Ryde, Table of n, a(n) for n = 0..10000

Jean Berstel, Luc Boasson, Olivier Carton, and Isabelle Fagnot, Infinite words without palindrome, arXiv:0903.2382 [cs.DM], 2009, section 3 word "y".

Kevin Ryde, PARI/GP Code

Formula

With quotient q = floor(n/9) and remainder r = n mod 9:

a(n) = 1 - A014707(q) if r = 2;

a(n) = A014707(q) if r = 4;

a(n) = 1 if q even and r in {0, 3, 6, 7}, or q odd and r in {3, 8};

a(n) = 0 otherwise.

Example

Expansion of the terms of A372257 by h begins:
  A372257       = 0,     1,       2,         ...
  this sequence = 1,0,1, 1,0,0,1, 1,0,0,0,1, ...

Prog

(PARI) \\ See links.

Crossrefs

Cf. A014707, A372257, A372258.

Sequence in context: A341347 A137893 A108882 * A284656 A168002 A267050

Adjacent sequences: A369986 A369987 A369988 * A369990 A369991 A369992

Keyword

nonn,easy

Author

Kevin Ryde, May 14 2024

Status

approved