%I A052008
%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,66,
%T A052008 77,88,99,110,121,33,44,55,66,77,88,99,110,121,132,44,55,66,77,88,99,
%U A052008 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'.
%H A052008 Zak Seidov, <a href="b052008.txt"> a(n),n=0..1000</a>
%H A052008 Nick Hobson, <a href="a052008.py.txt">Python program for this sequence</
               a>
%e A052008 E.g. n = 19 -> 19 + 91 = 110.
%Y A052008 Cf. A052009, A056964.
%Y A052008 Sequence in context: A070196 A113603 A056964 this_sequence A117463 A095371 
               A055960
%Y A052008 Adjacent sequences: A052005 A052006 A052007 this_sequence A052009 A052010 
               A052011
%K A052008 nonn,base,nice
%O A052008 0,2
%A A052008 Patrick De Geest (pdg(AT)worldofnumbers.com), Nov 15 1999.