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 A169824 #17 Aug 13 2020 14:02:28 %S A169824 1,2,3,4,5,6,7,8,9,10,11,20,22,30,33,40,44,50,55,60,66,70,77,80,88,90, %T A169824 99,100,101,110,111,121,131,141,151,161,171,181,191,200,202,212,220, %U A169824 222,232,242,252,262,272,282,292,300,303,313,323,330,333,343,353,363,373,383,393 %N A169824 Numbers n such that n is divisible by n-with-its-digits-reversed. %C A169824 If n is a term, then so is n*10^k. Positive terms in A002113 is a subsequence. - _Chai Wah Wu_, Sep 28 2017 %C A169824 a(n) = A061917(n+1) for 1 <= n < 78, but a(78) = 510 differs from A061917(79) = 515. - _Georg Fischer_, Oct 28 2018 %H A169824 Chai Wah Wu, <a href="/A169824/b169824.txt">Table of n, a(n) for n = 1..10000</a> %H A169824 Erich Friedman, <a href="https://erich-friedman.github.io/numbers.html">What's Special About This Number?</a> (See the entry for "540") %H A169824 L. H. Kendrick, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL18/Kendrick/ken1.html">Young Graphs: 1089 et al.</a>, J. Int. Seq. 18 (2015) 15.9.7. %e A169824 40 is divisible by 4. %t A169824 fQ[n_] := Mod[n, FromDigits@ Reverse@ IntegerDigits@ n] == 0; Select[ Range@ 399, fQ@# &] (* _Robert G. Wilson v_, Jun 10 2010 *) %o A169824 (Python) %o A169824 A169824_list = [n for n in range(1,1000) if not n % int(str(n)[::-1])] # _Chai Wah Wu_, Sep 28 2017 %Y A169824 Cf. A031877. %Y A169824 Cf. A002113. - _Robert G. Wilson v_, Jun 10 2010 %K A169824 nonn,base %O A169824 1,2 %A A169824 _N. J. A. Sloane_, May 29 2010