A075992 Duplicate of A022294.
4, 5, 7, 7, 10, 10, 10, 37, 37, 37, 37, 55, 55, 55, 55, 55, 55, 55, 82, 82, 82, 82, 82, 82
Offset: 1
This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
a(3)=7 because A000002 begins 1,2,2 and this first repeats at position 7.
See Links section.
lim:=1000: s:=[1, 2, 2]: for n from 3 to lim do for i from 1 to s[n] do s:=[op(s), 1+((n-1)mod 2)]: od: od: k:=1: for n from 1 to 1400 do inseq:=true: for m from 1 to k do if(not s[n+m]=s[m])then inseq:=false:break: fi: od: if(inseq)then printf("%d, ",n+1): k:=k+1:fi: od: # Nathaniel Johnston, May 02 2011
(* Here, the condition k>1 is removed, so the 1st term is 1 instead of 4. *)
n = 28; w = Prepend[Nest[Flatten[Partition[#, 2] /. {{2, 2} -> {2, 2, 1, 1}, {2, 1} -> {2, 2, 1}, {1, 2} -> {2, 1, 1}, {1, 1} -> {2, 1}}] &, {2, 2}, n], 1];
wStr = ToString[FromDigits[w]];
Map[StringPosition[wStr, StringReverse[StringTake[wStr, #]],1][[1]][[1]] &, Range[100]] (* Peter J. C. Moses, Feb 18 2021 *)
See Links section.