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 A083136 #21 May 09 2021 19:24:30
%S A083136 1,2,3,4,5,6,7,8,9,11,101,111,121,131,141,151,161,171,181,191,202,313,
%T A083136 323,333,343,353,363,373,383,393,404,515,606,727,737,747,757,767,777,
%U A083136 787,797,808,919,929,939,949,959,969,979,989,999,1001,10001,10101,10201
%N A083136 a(n+1) is the smallest palindrome greater than a(n) and relatively prime to a(n).
%C A083136 Subsequence of A002113. - _Michel Marcus_, May 25 2014
%C A083136 Contains at most one 2k-digit number for every k, since all such palindromes are divisible by 11. - _Ivan Neretin_, Aug 12 2015
%H A083136 Giovanni Resta, <a href="/A083136/b083136.txt">Table of n, a(n) for n = 1..10000</a>
%t A083136 spal[n_]:=Module[{k=n+1},While[!PalindromeQ[k]||!CoprimeQ[k,n],k++];k]; NestList[spal,1,60] (* _Harvey P. Dale_, May 09 2021 *)
%o A083136 (PARI) ispal(n) = my(d=digits(n)); d == Vecrev(d);
%o A083136 lista(nn) = {print1(last = 1, ", "); for (n=2, nn, if (ispal(n) && gcd(n, last)== 1, print1(n, ", "); last = n;););} \\ _Michel Marcus_, Aug 12 2015
%Y A083136 Cf. A002113, A081939.
%K A083136 base,easy,nonn
%O A083136 1,2
%A A083136 _Amarnath Murthy_ and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Apr 24 2003
%E A083136 More terms from _David Wasserman_, Oct 19 2004