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 A110751 #18 Dec 07 2019 12:18:25
%S A110751 1,2,3,4,5,6,7,8,9,11,22,33,44,55,66,77,88,99,101,111,121,131,141,151,
%T A110751 161,171,181,191,202,212,222,232,242,252,262,272,282,292,303,313,323,
%U A110751 333,343,353,363,373,383,393,404,414,424,434,444,454,464,474,484,494
%N A110751 Numbers n such that n and its digital reversal have the same prime divisors.
%C A110751 Contains the palindromes A002113 as a subsequence. 1089 and 2178 are the first two non-palindromic terms. Any number of concatenations of 1089 with itself or 2178 with itself gives a term; e.g. 10891089 etc. Hence there are infinitely many non-palindromic terms. They are given in A110819.
%H A110751 Derek Orr, <a href="/A110751/b110751.txt">Table of n, a(n) for n = 1..1000</a>
%e A110751 1089 = 3^2*11^2, 9801 = 3^4*11^2.
%t A110751 Select[ Range[ 500], First /@ FactorInteger[ # ] == First /@ FactorInteger[ FromDigits[ Reverse[ IntegerDigits[ # ]]]] &] (* _Robert G. Wilson v_ *)
%o A110751 (PARI) is_A110751(n)={ local(r=eval(concat(vecextract(Vec(Str(n)),"-1..1")))); r==n || factor(r)[,1]==factor(n)[,1] } /* _M. F. Hasler_ */
%o A110751 (Python)
%o A110751 from sympy import primefactors
%o A110751 A110751 = [n for n in range(1,10**5) if primefactors(n) == primefactors(int(str(n)[::-1]))] # _Chai Wah Wu_, Aug 14 2014
%Y A110751 Cf. A002113, A110819.
%K A110751 base,easy,nonn
%O A110751 1,2
%A A110751 _Amarnath Murthy_, Aug 11 2005
%E A110751 Edited and extended by _Robert G. Wilson v_, Sep 21 2005
%E A110751 Corrected comment, added PARI code. - _M. F. Hasler_, Nov 16 2008