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 A260462 #19 Jul 27 2015 22:10:07 %S A260462 12,15,16,18,24,25,36,45,48,125,128,144,168,225,256,288,1125,1344, %T A260462 2688,12288,111888 %N A260462 Numbers k such that the digits of k are in increasing order and k divides (reverse(k) * 10^m) for some sufficiently-large integer m. %C A260462 This sequence consists of the set of distinct numbers that result from taking the terms of A260461, sorting the digits of each term in ascending order, and discarding the leading zeros. %C A260462 (Equivalently, this sequence consists of the set of distinct numbers that result from taking the terms of A096091 whose nonzero digits are not all the same, sorting the digits of each term in ascending order, and discarding the leading zeros.) %C A260462 Through a(21) = 111888, the digits 7 and 9 do not appear. %C A260462 After a(21) = 111888, there are no more terms through 10^27. Presumably, the sequence is full. Is there a proof? %Y A260462 Cf. A096091, A260461. %K A260462 nonn,base %O A260462 1,1 %A A260462 _Jon E. Schoenfield_, Jul 26 2015