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.
%I A345111 #9 Jun 09 2021 23:22:23 %S A345111 0,2,4,6,8,10,12,14,16,18,11,22,33,44,55,66,77,88,99,110,22,33,44,55, %T A345111 66,77,88,99,110,121,33,44,55,66,77,88,99,110,121,132,44,55,66,77,88, %U A345111 99,110,121,132,143,55,66,77,88,99,110,121,132,143,154,66,77,88 %N A345111 a(n) = n + A345110(n). %C A345111 First differs from both A052008 and A056964 at n = 101. %e A345111 For n = 101: 101 + A345110(101) = 101 + 11 = 112, so a(101) = 112. %t A345111 Array[#+FromDigits@RotateLeft@IntegerDigits@#&,100,0] (* _Giorgos Kalogeropoulos_, Jun 09 2021 *) %o A345111 (PARI) eva(n) = subst(Pol(n), x, 10) %o A345111 rot(vec) = if(#vec < 2, return(vec)); my(s=concat(Str(2), ".."), v=[]); s=concat(s, Str(#vec)); v=vecextract(vec, s); v=concat(v, vec[1]); v %o A345111 a(n) = n + eva(rot(digits(n))) %o A345111 (Python) %o A345111 def rotl(s): return s[1:] + s[0] %o A345111 def a(n): return n + int(rotl(str(n))) %o A345111 print([a(n) for n in range(63)]) # _Michael S. Branicky_, Jun 09 2021 %Y A345111 Cf. A052008, A056964, A345110, A345112, A345113, A345114, A345115. %K A345111 nonn,base,easy %O A345111 0,2 %A A345111 _Felix Fröhlich_, Jun 09 2021