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 A347346 #18 Aug 30 2021 17:18:56 %S A347346 1,2,3,4,5,6,7,8,9,0,11,212,313,414,515,616,717,818,919,0,121,22,323, %T A347346 424,525,626,727,828,929,0,131,232,33,434,535,636,737,838,939,0,141, %U A347346 242,343,44,545,646,747,848,949,0,151,252,353,454,55,656,757,858,959 %N A347346 Smallest palindrome ending with n or 0 if n is a multiple of 10. %H A347346 Chai Wah Wu, <a href="/A347346/b347346.txt">Table of n, a(n) for n = 1..10000</a> %F A347346 If n is not a multiple of 10, then a(n) = A082216(A004086(n)). %o A347346 (Python) %o A347346 def A347346(n): %o A347346 if n % 10 == 0: %o A347346 return 0 %o A347346 s = str(n) %o A347346 if s == s[::-1]: %o A347346 return n %o A347346 for i in range(1,len(s)): %o A347346 if s[:-i]== s[-i-1::-1]: %o A347346 return int(s[:-i-1:-1]+s) %Y A347346 Cf. A004086, A082216, A347347. %K A347346 nonn,base,look %O A347346 1,2 %A A347346 _Chai Wah Wu_, Aug 27 2021