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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A332604 Limiting word over the alphabet {1,2,3} defined by the process in A332603, or, in case that process terminates, the final term in A332603. 1
 1, 2, 1, 3, 1, 2, 3, 1, 3, 2, 1, 2, 3, 1, 2, 1, 3, 1, 2, 3, 1, 3, 2, 3, 1, 2, 1, 3, 1, 2, 3, 2, 1, 2, 3, 1, 2, 1, 3, 1, 2, 3, 1, 3, 2, 1, 2, 3, 1, 2, 1, 3, 1, 2, 3, 2, 1, 2, 3, 1, 2, 1, 3, 2, 1, 2, 3, 1, 3, 2, 3, 1, 2, 1, 3, 1, 2, 3, 1, 3, 2, 1, 2, 3, 1, 2, 1, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Grytczuk et al. (2020) conjecture that the process in A332603 never terminates, and report that they have computed the first 5000 terms of the limiting word. LINKS Table of n, a(n) for n=1..88. Jaroslaw Grytczuk, Hubert Kordulewski, Artur Niewiadomski, Extremal Square-Free Words, Electronic J. Combinatorics, 27 (1), 2020, #1.48. MATHEMATICA sqfQ[str_] := StringFreeQ[str, x__ ~~ x__]; ext[s_] := Catch@ Block[{t}, Do[ If[sqfQ[t = StringInsert[s, e, -p]], Throw@ t], {p, StringLength[s] + 1}, {e, {"1", "2", "3"} } ]]; a[1]=1; a[n_] := a[n] = ToExpression@ ext@ ToString@ a[n-1]; IntegerDigits@ a[88] (* Giovanni Resta, Mar 09 2020 *) CROSSREFS Cf. A332603. Sequence in context: A275875 A105497 A255809 * A132662 A279782 A358921 Adjacent sequences: A332601 A332602 A332603 * A332605 A332606 A332607 KEYWORD nonn AUTHOR N. J. A. Sloane, Mar 07 2020 EXTENSIONS More terms from Giovanni Resta, Mar 09 2020 STATUS approved

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.

Last modified June 23 10:38 EDT 2024. Contains 373643 sequences. (Running on oeis4.)