a(1) = 1; for n>1, a(n) = largest integer k such that the word a(1)a(2)...a(n-1) is of is of the form xy^(k_1)Y^(k_2)y^(k_3)Y^(k_4)...y^(k_(m-1))Y^(k_m) where y has positive length and Y=reverse(y) and k_1+k_2+k_3+...+k_m = k.
A091975
a(1) = 1; for n>1, a(n) = largest integer k such that the word a(1)a(2)...a(n-1) is of is of the form xy^(k_1)Y^(k_2)y^(k_3)Y^(k_4)...y^(k_(m-1))Y^(k_m) where y has positive length and Y=reverse(y) and k_1+k_2+k_3+...+k_m = k.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =1a(4) =1a(5) =2a(6) =2a(7) =2a(8) =3a(9) =1a(10) =1a(11) =2a(12) =1a(13) =1a(14) =2a(15) =2a(16) =2a(17) =3a(18) =2a(19) =1a(20) =1a(21) =2a(22) =2a(23) =2a(24) =3a(25) =2a(26) =2a(27) =2a(28) =3a(29) =2
External references
- oeis: A091975