A332603 - cp's OEIS frontend

A332603 Working over the alphabet {1,2,3}, start with a(1) = 1; then a(n+1) is made by inserting a letter into a(n) at the rightmost possible position which makes a squarefree word (and the smallest letter if multiple letters are possible at that place).

n	a(n)
1	1
2	12
3	121
4	1213
5	12131
6	121312
7	1213121
8	12131231
9	121312313
10	1213123132
11	12131231321
12	121312313212
13	1213123132123
14	12131231321231
15	121312313212312
16	1213123132123121
17	12131231321231213
18	121312313212312131
19	1213123132123121312
20	12131231321231213123
21	121312313212312131231

[1, 12, 121, 1213, 12131, 121312, 1213121, 12131231, 121312313, 1213123132, 12131231321, 121312313212, 1213123132123, 12131231321231, 121312313212312, 1213123132123121, 12131231321231213, 121312313212312131, 1213123132123121312, 12131231321231213123, 121312313212312131231]

cp's OEIS Frontend

A332603 Working over the alphabet {1,2,3}, start with a(1) = 1; then a(n+1) is made by inserting a letter into a(n) at the rightmost possible position which makes a squarefree word (and the smallest letter if multiple letters are possible at that place).

Table of values

List of values