A070196 a(n) = n plus the sorted version of the base-10 digits of n.
0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 11, 22, 24, 26, 28, 30, 32, 34, 36, 38, 22, 33, 44, 46, 48, 50, 52, 54, 56, 58, 33, 44, 55, 66, 68, 70, 72, 74, 76, 78, 44, 55, 66, 77, 88, 90, 92, 94, 96, 98, 55, 66, 77, 88, 99, 110, 112, 114, 116, 118, 66, 77, 88, 99, 110, 121, 132, 134
Offset: 0
Links
- Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
- Eric Weisstein's World of Mathematics, Sort-Then-Add Sequence
Programs
-
Haskell
a070196 n = n + a004185 n -- Reinhard Zumkeller, Apr 03 2015
-
Maple
a:= n-> n+parse(cat(sort(convert(n, base, 10))[])): seq(a(n), n=0..67); # Alois P. Heinz, Jan 15 2024
-
Mathematica
Table[n+FromDigits[Sort[IntegerDigits[n]]],{n,0,70}] (* Harvey P. Dale, Feb 08 2020 *)
-
Python
def a(n): return n + int("".join(sorted(str(n)))) print([a(n) for n in range(68)]) # Michael S. Branicky, Jan 15 2024
Formula
a(n) = n + A004185(n). - Reinhard Zumkeller, Apr 03 2015
Extensions
Zero prepended and offset changed by Reinhard Zumkeller, Apr 03 2015