OFFSET
1,2
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 (full sequence)
Eric Weisstein's World of Mathematics, Lexicographic Order.
Eric Weisstein's World of Mathematics, Hexadecimal.
Wikipedia, Lexicographical order.
Wikipedia, Hexadecimal.
EXAMPLE
a(17) = 4109 -> 100D [hex];
a(18) = 4110 -> 100E [hex];
a(19) = 4111 -> 100F [hex];
a(20) = 257 -> 101 [hex];
a(21) = 4112 -> 1010 [hex];
a(22) = 4113 -> 1011 [hex];
largest term a(6301) = 10000 -> 2710 [hex];
last term a(10000) = 4095 -> FFF [hex], largest term lexicographically.
PROG
(Haskell)
import Data.Ord (comparing)
import Data.List (sortBy)
import Numeric (showHex)
a190134 n = a190134_list !! (n-1)
a190134_list = sortBy (comparing (flip showHex "")) [1..10000]
CROSSREFS
KEYWORD
nonn,base,fini,full
AUTHOR
Reinhard Zumkeller, May 06 2011
STATUS
approved