|
%I #18 Feb 23 2023 04:21:36
%S 1,16,256,4096,4097,4098,4099,4100,4101,4102,4103,4104,4105,4106,4107,
%T 4108,4109,4110,4111,257,4112,4113,4114,4115,4116,4117,4118,4119,4120,
%U 4121,4122,4123,4124,4125,4126,4127,258,4128,4129,4130,4131,4132,4133,4134
%N Numbers 1 through 10000 sorted lexicographically in hexadecimal representation (base 16).
%C A190135 = inverse permutation: a(A190135(n)) = A190135(a(n)) = n;
%C a(n) <> n for n > 1.
%H Reinhard Zumkeller, <a href="/A190134/b190134.txt">Table of n, a(n) for n = 1..10000</a> (full sequence)
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/LexicographicOrder.html">Lexicographic Order</a>.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Hexadecimal.html">Hexadecimal</a>.
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Lexicographical_order">Lexicographical order</a>.
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Hexadecimal">Hexadecimal</a>.
%e a(17) = 4109 -> 100D [hex];
%e a(18) = 4110 -> 100E [hex];
%e a(19) = 4111 -> 100F [hex];
%e a(20) = 257 -> 101 [hex];
%e a(21) = 4112 -> 1010 [hex];
%e a(22) = 4113 -> 1011 [hex];
%e largest term a(6301) = 10000 -> 2710 [hex];
%e last term a(10000) = 4095 -> FFF [hex], largest term lexicographically.
%o (Haskell)
%o import Data.Ord (comparing)
%o import Data.List (sortBy)
%o import Numeric (showHex)
%o a190134 n = a190134_list !! (n-1)
%o a190134_list = sortBy (comparing (flip showHex "")) [1..10000]
%Y Cf. A190126 (base 2), A190128 (base 3), A190130 (base 8), A190016 (base 10), A190132 (base 12).
%K nonn,base,fini,full
%O 1,2
%A _Reinhard Zumkeller_, May 06 2011
| 