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 A055162 #16 Aug 18 2025 00:09:59 %S A055162 459,1467,445599,134667,13346667,1245789,123456789,444555999, %T A055162 1333466667,123456789,12457899,12334566789,133334666667,12334566789, %U A055162 1234567899,124578999,444455559999,1233345666789 %N A055162 The number n has digits in ascending order and n=a-b where a has the digits of n in descending order and b has the digits of n in another order (a and b perhaps with extra zeros), ordered by a. %C A055162 Each term of this sequence A055162(n) corresponds to A099009(n+1), with its digits being reordered in the ascending manner. - _Alexander R. Povolotsky_, Apr 26 2012 %C A055162 All terms of this sequence are divisible by nine, yielding 51, 163, 49511, 14963, 1482963,.... - _Alexander R. Povolotsky_, Apr 29 2012 %D A055162 Denis Borris, Ken Duisenberg's Puzzle of the Week, April 20, 2000 %H A055162 <a href="http://www.ecst.csuchico.edu/~kend/potw/archive/000420sol.html">Source</a> %F A055162 a(n) = A055161(n) - A055160(n). %e A055162 459 = 954 - 495. %Y A055162 Cf. A055159, A099009. %K A055162 base,nonn %O A055162 1,1 %A A055162 _Henry Bottomley_, Apr 27 2000