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 A071590 #28 Jan 16 2022 14:22:07
%S A071590 10,20,21,30,31,32,40,41,42,43,50,51,52,53,54,60,61,62,63,64,65,70,71,
%T A071590 72,73,74,75,76,80,81,82,83,84,85,86,87,90,91,92,93,94,95,96,97,98,
%U A071590 100,110,120,130,140,150,160,170,180,190,200,201,210,211,220,221,230,231
%N A071590 Numbers k such that reversal(k) < k.
%H A071590 David A. Corneth, <a href="/A071590/b071590.txt">Table of n, a(n) for n = 1..5400</a> (first 1000 terms from T. D. Noe)
%t A071590 Select[Range[300], # > FromDigits[Reverse[IntegerDigits[#]]] &] (* _T. D. Noe_, Mar 14 2012 *)
%t A071590 Select[Range[300],IntegerReverse[#]<#&] (* _Harvey P. Dale_, Jan 16 2022 *)
%o A071590 (PARI) for(i=2,300,n=(i); s=ceil(log(n)/log(10)); if((sum(i=0,s,10^(s-i-1)*(floor(n/10^i*1.)-10*floor(n/10^(i+1)*1.))))<i,print1((i),",")))
%o A071590 (PARI) is(n) = {fromdigits(Vecrev(digits(n)))<n} \\ _David A. Corneth_, Apr 07 2021
%o A071590 (Python)
%o A071590 def ok(n): return int(str(n)[::-1]) < n
%o A071590 print([k for k in range(232) if ok(k)]) # _Michael S. Branicky_, Oct 20 2021
%Y A071590 Cf. A004086 (digit reversal), A071589 (reversal(k) > k), A002113 (reversal(k) = k).
%Y A071590 Cf. A161602 (binary reversal(k) < k).
%K A071590 nonn,easy,base
%O A071590 1,1
%A A071590 _Benoit Cloitre_, Jun 01 2002
%E A071590 Definition corrected by _Harvey P. Dale_, Jan 16 2022