

A026490


Length of nth run of identical symbols in A026465.


3



1, 1, 2, 3, 2, 1, 2, 1, 2, 3, 2, 3, 2, 3, 2, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3, 2, 3, 2, 3, 2, 1, 2, 1, 2, 3, 2, 3, 2, 3, 2, 1, 2, 1, 2, 3, 2, 3, 2, 3, 2, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3, 2, 3, 2, 3, 2, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,3


COMMENTS

From JeanPaul Allouche and Michel Dekking, Sep 08 2019: (Start)
This sequence is a morphic sequence, i.e., the letter to letter image of a fixed point of a morphism. The morphism is defined on a fourletter alphabet:
1 > 322, 2 > 1212, 3 > 323232, 4 > 412.
The lettertoletter map is given by 1 > 1, 2 > 2, 3 > 3, 4 > 1. The fixed point is the fixed point with prefix 4.
How is this obtained? Note that A026465 only has runs of the forms 2, 11 and 222. A026465 itself is the fixed point of the morphism alpha: 1 > 121, 2 > 12221.
The images of the runs under alpha are alpha(2) = 12221, alpha(11) = 121121, alpha(222) = 122211222112221. Coding the runs with their lengths this induces a morphism on the coded runs: 1 > 32, 2 > 1212, 3 > 323232.
Here we use the fact that all three alphaimages have 1 as a prefix and as a suffix. This yields the 2 (coding of 11) at the end of the three images 32, 1212, 323232. The letter 4 is then added to deal with the somewhat strange fact that a(1)=1, a(2)=1. Strange, because the word 11 occurs nowhere else in (a(n)).
Actually, one can show in a similar way, using the square of the morphism 1 > 2, 2 > 211 instead of the morphism alpha, that (a(n+1)) = 1,2,3,2,1,2,...
is a purely morphic sequence, fixed point of the morphism 1 > 123, 2 > 212, 3 > 1232323.
One sees from this (by projecting 1, 3 > 1, 2 > 2) that (a(n)) has the property a(2n+1) = 2 for all n > 1. Also, by removing the 2's, one sees that the sequence of 1's and 3's is the fixed point of the morphism 1 > 131, 3 > 13331, which is the sequence A080426.
(End)


LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Claude Lenormand, Deux transformations sur les mots, Preprint, 5 pages, Nov 17 2003. Apparently unpublished. This is a scanned copy of the version that the author sent to me in 2003.  N. J. A. Sloane, Sep 09 2018. See page 2.


FORMULA

a(1)=1, a(2n) = A080426(n) for all n > 0, a(2n+1) = 2 for all n > 1.  JeanPaul Allouche and Michel Dekking, Sep 08 2019


MATHEMATICA

Length /@ Split[Length /@ Split[ThueMorse[Range[0, 200]]]] (* Vladimir Reshetnikov, Apr 27 2016 *)


PROG

(Haskell)
import Data.List (group)
a026490 n = a026490_list !! (n1)
a026490_list = map length $ group a026465_list
 Reinhard Zumkeller, Jul 15 2014


CROSSREFS

Cf. A010060, A026465.
Sequence in context: A137927 A321864 A084311 * A053555 A324645 A124160
Adjacent sequences: A026487 A026488 A026489 * A026491 A026492 A026493


KEYWORD

nonn


AUTHOR

Clark Kimberling


STATUS

approved



