A052008 a(n) = 'n with digits sorted in ascending order' + 'n with digits sorted in descending order'.

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, 77, 88, 99, 110, 121, 33, 44, 55, 66, 77, 88, 99, 110, 121, 132, 44, 55, 66, 77, 88, 99, 110, 121, 132, 143, 55, 66, 77, 88, 99, 110, 121, 132, 143, 154, 66, 77, 88, 99, 110, 121

Offset

0,2

Comments

a(n) = A004185(n) + A004186(n). - Reinhard Zumkeller, Jun 07 2015

Links

Zak Seidov and Michael De Vlieger, Table of n, a(n) for n = 0..9999 (First 1000 terms from Zak Seidov)

Nick Hobson, Python program for this sequence

Example

E.g., n = 19 -> 19 + 91 = 110.

Mathematica

f[n_]:=Module[{sidn=Sort[IntegerDigits[n]]}, FromDigits[sidn]+ FromDigits[ Reverse[sidn]]]; Array[f, 70, 0] (* Harvey P. Dale, Nov 13 2011 *)

Prog

(Haskell)
a052008 n = a004185 n + a004186 n  -- Reinhard Zumkeller, Jun 07 2015
(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

Crossrefs

Cf. A052009; different from A056964.

Cf. A004185, A004186, A271497.

Sequence in context: A070196 A345111 A056964 * A117463 A248609 A375036

Adjacent sequences: A052005 A052006 A052007 * A052009 A052010 A052011

Keyword

nonn,base,nice,look

Author

Patrick De Geest, Nov 15 1999

Status

approved