|
| |
|
|
A004186
|
|
Arrange digits of n in decreasing order.
|
|
4
| |
|
|
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 21, 31, 41, 51, 61, 71, 81, 91, 20, 21, 22, 32, 42, 52, 62, 72, 82, 92, 30, 31, 32, 33, 43, 53, 63, 73, 83, 93, 40, 41, 42, 43, 44, 54, 64, 74, 84, 94, 50, 51, 52, 53, 54, 55, 65, 75, 85, 95, 60, 61, 62, 63, 64, 65, 66, 76, 86, 96, 70, 71, 72
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| a(A009996(n)) = A009996(n). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 31 2007
|
|
|
LINKS
| R. Zumkeller, Table of n, a(n) for n = 0..10000
|
|
|
MATHEMATICA
| f[n_] := FromDigits@ Reverse@ Sort@ IntegerDigits@ n; Array[f, 73, 0] (Robert G. Wilson v, Aug 19 2011 *)
|
|
|
PROG
| Contribution from Michael Porter (michael_b_porter(AT)yahoo.com), Nov 11 2009: (Start)
(PARI) digits(n) = if(n<10, [n], concat(digits(floor(n/10)), n%10))
reconstruct(m) = {local(r); r=0; for(i=1, matsize(m)[2], r=r*10+m[i]); r}
A004186(n) = reconstruct(vecsort(digits(n), 4)) (End)
(Haskell)
import Data.List (sort)
a004186 = read . reverse . sort . show :: Integer -> Integer
-- Reinhard Zumkeller, Aug 19 2011
|
|
|
CROSSREFS
| Cf. A064222, A194233.
Sequence in context: A130575 A068637 A064222 * A034704 A023792 A178354
Adjacent sequences: A004183 A004184 A004185 * A004187 A004188 A004189
|
|
|
KEYWORD
| nonn,base
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
EXTENSIONS
| More terms from Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 31 2007
|
| |
|
|
