A227362 Distinct digits of n arranged in decreasing order.
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 1, 21, 31, 41, 51, 61, 71, 81, 91, 20, 21, 2, 32, 42, 52, 62, 72, 82, 92, 30, 31, 32, 3, 43, 53, 63, 73, 83, 93, 40, 41, 42, 43, 4, 54, 64, 74, 84, 94, 50, 51, 52, 53, 54, 5, 65, 75, 85, 95, 60, 61, 62, 63, 64, 65, 6, 76, 86
Offset: 0
Links
- Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
Programs
-
Haskell
import Data.List (nub, sort) a227362 = read . reverse . sort . nub . show :: Integer -> Integer
-
Maple
a:= n-> parse(cat(sort([{convert(n, base, 10)[]}[]], `>`)[])): seq(a(n), n=0..68); # Alois P. Heinz, Sep 21 2022
-
Mathematica
f[n_] := FromDigits[Reverse@ Union@ IntegerDigits@ n]; f /@ Range[0, 68] (* Michael De Vlieger, Apr 16 2015, corrected by Robert G. Wilson v *)
-
PARI
a(n) = {if (n == 0, d = [0], d = digits(n)); eval(subst(Pol(vecsort(d,,12)), x, 10));} \\ Michel Marcus, Apr 16 2015
-
PARI
a(n)=fromdigits(vecsort(digits(n),,12)) \\ Charles R Greathouse IV, Apr 16 2015
-
Python
def A227362(n): return int(''.join(sorted(set(str(n)),reverse=True))) # Chai Wah Wu, Nov 23 2022
Comments