cp's OEIS Frontend

A070196 a(n) = n plus the sorted version of the base-10 digits of n.

%I A070196 #16 Feb 16 2025 08:32:46
%S A070196 0,2,4,6,8,10,12,14,16,18,11,22,24,26,28,30,32,34,36,38,22,33,44,46,
%T A070196 48,50,52,54,56,58,33,44,55,66,68,70,72,74,76,78,44,55,66,77,88,90,92,
%U A070196 94,96,98,55,66,77,88,99,110,112,114,116,118,66,77,88,99,110,121,132,134
%N A070196 a(n) = n plus the sorted version of the base-10 digits of n.
%H A070196 Reinhard Zumkeller, <a href="/A070196/b070196.txt">Table of n, a(n) for n = 0..10000</a>
%H A070196 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Sort-Then-AddSequence.html">Sort-Then-Add Sequence</a>
%F A070196 a(n) = n + A004185(n). - _Reinhard Zumkeller_, Apr 03 2015
%p A070196 a:= n-> n+parse(cat(sort(convert(n, base, 10))[])):
%p A070196 seq(a(n), n=0..67);  # _Alois P. Heinz_, Jan 15 2024
%t A070196 Table[n+FromDigits[Sort[IntegerDigits[n]]],{n,0,70}] (* _Harvey P. Dale_, Feb 08 2020 *)
%o A070196 (Haskell)
%o A070196 a070196 n = n + a004185 n  -- _Reinhard Zumkeller_, Apr 03 2015
%o A070196 (Python)
%o A070196 def a(n): return n + int("".join(sorted(str(n))))
%o A070196 print([a(n) for n in range(68)]) # _Michael S. Branicky_, Jan 15 2024
%Y A070196 Cf. A033862.
%Y A070196 Cf. A004185, A033860 (iterated, starting with 1).
%K A070196 nonn,base
%O A070196 0,2
%A A070196 _Eric W. Weisstein_, Apr 27 2002
%E A070196 Zero prepended and offset changed by _Reinhard Zumkeller_, Apr 03 2015