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 A226778 #20 Aug 27 2020 10:37:22
%S A226778 1,10,13,14,16,17,19,23,25,29,31,32,34,35,37,38,41,43,47,49,52,53,56,
%T A226778 58,59,61,65,67,71,73,74,76,79,83,85,89,91,92,94,95,97,98,100,103,104,
%U A226778 106,107,109,112,113,115,116,118,119,122,124,125,127,128,130
%N A226778 Numbers having no common divisor > 1 with their reversal in decimal representation (see A043537).
%C A226778 A055483(a(n)) = 1.
%H A226778 Reinhard Zumkeller, <a href="/A226778/b226778.txt">Table of n, a(n) for n = 1..10000</a>
%t A226778 Select[Range[130], GCD[#, FromDigits[Reverse[IntegerDigits[#]]]] == 1 &] (* _Jayanta Basu_, Jul 24 2013 *)
%t A226778 Select[Range[150],Intersection[Divisors[#],Divisors[IntegerReverse[#]]] == {1}&] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Jul 07 2020 *)
%o A226778 (Haskell)
%o A226778 a226778 n = a226778_list !! (n-1)
%o A226778 a226778_list = filter ((== 1) . a055483) [1..]
%o A226778 (PARI) isok(n) = gcd(n, subst(Pol(Vecrev(digits(n))), x, 10)) == 1; \\ _Michel Marcus_, Jul 02 2015
%o A226778 (PARI) is(n)=gcd(fromdigits(Vecrev(digits(n))), n)==1 \\ _Charles R Greathouse IV_, Aug 25 2016
%Y A226778 Cf. A043537, A055483, A071249 (complement).
%K A226778 nonn,base
%O A226778 1,2
%A A226778 _Reinhard Zumkeller_, Jun 18 2013