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 A283001 #30 Mar 06 2017 17:24:02
%S A283001 0,0,0,0,0,0,0,0,0,0,0,0,1,2,3,4,5,6,7,8,0,0,0,1,2,3,4,5,6,7,0,0,0,0,
%T A283001 1,2,3,4,5,6,0,0,0,0,0,1,2,3,4,5,0,0,0,0,0,0,1,2,3,4,0,0,0,0,0,0,0,1,
%U A283001 2,3,0,0,0,0,0,0,0,0,1,2,0,0,0,0,0,0,0,0,0,1
%N A283001 a(n) = (A004186(n) - n)/9.
%C A283001 A004186(n) is the number formed when the digits of n are sorted nonincreasingly.
%C A283001 Is this the same as A037887 or A037851? - _R. J. Mathar_, Mar 06 2017
%H A283001 David A. Corneth, <a href="/A283001/b283001.txt">Table of n, a(n) for n = 0..9999</a>
%F A283001 a(10*n) = 10*a(n).
%e A283001 a(141) = (411 - 141)/9 = 30.
%t A283001 s[n_]:= FromDigits@ Reverse@ Sort@ IntegerDigits@ n; a[n_]:=(s[n]-n)/9; Table[a[n],{n,0,89}] (* _Indranil Ghosh_, Feb 26 2017 *)
%o A283001 (PARI) a(n) = my(d = digits(n), v=vecsort(d,,4)-d); sum(i=1,#v,v[i]*10^(#v-i)) / 9
%o A283001 (Python) def A283001(n): return (int("".join(sorted(str(n),reverse=True)))-n)/9 # _Indranil Ghosh_, Feb 26 2017
%Y A283001 Cf. A004186, A037887, A037851.
%K A283001 nonn,base,easy,look
%O A283001 0,14
%A A283001 _David A. Corneth_, Feb 26 2017