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 A052008 #34 Feb 27 2017 01:40:21
%S A052008 0,2,4,6,8,10,12,14,16,18,11,22,33,44,55,66,77,88,99,110,22,33,44,55,
%T A052008 66,77,88,99,110,121,33,44,55,66,77,88,99,110,121,132,44,55,66,77,88,
%U A052008 99,110,121,132,143,55,66,77,88,99,110,121,132,143,154,66,77,88,99,110,121
%N A052008 a(n) = 'n with digits sorted in ascending order' + 'n with digits sorted in descending order'.
%C A052008 a(n) = A004185(n) + A004186(n). - _Reinhard Zumkeller_, Jun 07 2015
%H A052008 Zak Seidov and Michael De Vlieger, <a href="/A052008/b052008.txt">Table of n, a(n) for n = 0..9999</a> (First 1000 terms from Zak Seidov)
%H A052008 Nick Hobson, <a href="/A052008/a052008.py.txt">Python program for this sequence</a>
%e A052008 E.g., n = 19 -> 19 + 91 = 110.
%t A052008 f[n_]:=Module[{sidn=Sort[IntegerDigits[n]]},FromDigits[sidn]+ FromDigits[ Reverse[sidn]]]; Array[f,70,0] (* _Harvey P. Dale_, Nov 13 2011 *)
%o A052008 (Haskell)
%o A052008 a052008 n = a004185 n + a004186 n -- _Reinhard Zumkeller_, Jun 07 2015
%o A052008 (PARI) for(n=0,100,D=digits(n);R=Vecrev(D);print1(sum(i=1,#D,10^(i-1)*(D[i]+R[i])),", ")) \\ _Derek Orr_, Feb 26 2017
%Y A052008 Cf. A052009; different from A056964.
%Y A052008 Cf. A004185, A004186, A271497.
%K A052008 nonn,base,nice,look
%O A052008 0,2
%A A052008 _Patrick De Geest_, Nov 15 1999