A190134 Numbers 1 through 10000 sorted lexicographically in hexadecimal representation (base 16).
1, 16, 256, 4096, 4097, 4098, 4099, 4100, 4101, 4102, 4103, 4104, 4105, 4106, 4107, 4108, 4109, 4110, 4111, 257, 4112, 4113, 4114, 4115, 4116, 4117, 4118, 4119, 4120, 4121, 4122, 4123, 4124, 4125, 4126, 4127, 258, 4128, 4129, 4130, 4131, 4132, 4133, 4134
Offset: 1
Examples
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.
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.
Crossrefs
Programs
-
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]
Comments