This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A052008 a(n) = 'n with digits sorted in ascending order' + 'n with digits sorted in descending order'. 12
 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 (list; graph; refs; listen; history; text; internal format)
 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: A262223 A070196 A056964 * A117463 A248609 A055960 Adjacent sequences:  A052005 A052006 A052007 * A052009 A052010 A052011 KEYWORD nonn,base,nice,look AUTHOR Patrick De Geest, Nov 15 1999 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 17 10:59 EST 2019. Contains 319218 sequences. (Running on oeis4.)