[seqfan] Square words on my left

[Éric Angelini]

Hello SeqFans,
S = 0,0,1,0,0,1,1,2,0,0,1,0,0,1,1,2,1,0,0,1,0,0,2,0,0,1,0,0,1,1,2,0,0,1,0,0,1,1,3,0,0,1,0,0,1,1,2,0,0,1,0,0,1,1,2,1,...

a(n) counts the square-words immediately before a(n), with a(1) = 0.
This was inspired by the hereunder two OEIS sequences (a big thanks to Maximilian F. Hasler !-)

https://oeis.org/A248034 
[a(n+1) gives the number of occurrences of the last digit of a(n) so far, up to and including a(n), with a(0)=0.]

https://oeis.org/A329447 
[Look left and tell the least frequent: after a(0) = 0, a(n) = 10c + d, where c > 0 is the number of times the least frequent digit d has appeared so far; smallest d in case of tie].
More on my personal blog here:
https://cinquantesignes.blogspot.com/2019/11/squares-on-my-immediate-left.html
Best,
É.


à+
É.
Catapulté de mon aPhone