|
%I #28 Feb 23 2023 04:21:19
%S 1,10,100,1000,10000,1001,1002,1003,1004,1005,1006,1007,1008,1009,101,
%T 1010,1011,1012,1013,1014,1015,1016,1017,1018,1019,102,1020,1021,1022,
%U 1023,1024,1025,1026,1027,1028,1029,103,1030,1031,1032,1033,1034,1035,1036
%N Numbers 1 through 10000 sorted lexicographically in decimal representation.
%C A190017 = inverse permutation: a(A190017(n)) = A190017(a(n)) = n;
%C there are 11 fixed points: {1,9980,9981,9982,9983,9984,9985,9986,9987,9988,9989}.
%H Reinhard Zumkeller, <a href="/A190016/b190016.txt">Table of n, a(n) for n = 1..10000</a> (full sequence)
%H Eric Weisstein, <a href="http://mathworld.wolfram.com/LexicographicOrder.html">Lexicographic Order</a>.
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Lexicographical_order">Lexicographical order</a>.
%e a(13) = 1008;
%e a(14) = 1009;
%e a(15) = 101;
%e a(16) = 1010;
%e a(17) = 1011;
%e largest term a(5) = 10000;
%e last term a(10000) = 9999, largest term lexicographically.
%o (Haskell)
%o import Data.Ord (comparing)
%o import Data.List (sortBy)
%o a190016 n = a190016_list !! (n-1)
%o a190016_list = sortBy (comparing show) [1..10000]
%o (PARI) eval(Set(vector(10^4,n,Str(n)))) \\ _M. F. Hasler_, Oct 25 2019
%Y Cf. A119589 (same for 1..100); A190126 (base 2), A190128 (base 3), A190130 (base 8), A190132 (base 12), A190134 (base 16).
%K nonn,base,fini,full
%O 1,2
%A _Reinhard Zumkeller_, May 06 2011
|
