The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A190016 Numbers 1 through 10000 sorted lexicographically in decimal representation. 10
 1, 10, 100, 1000, 10000, 1001, 1002, 1003, 1004, 1005, 1006, 1007, 1008, 1009, 101, 1010, 1011, 1012, 1013, 1014, 1015, 1016, 1017, 1018, 1019, 102, 1020, 1021, 1022, 1023, 1024, 1025, 1026, 1027, 1028, 1029, 103, 1030, 1031, 1032, 1033, 1034, 1035, 1036 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A190017 = inverse permutation: a(A190017(n)) = A190017(a(n)) = n; there are 11 fixed points: {1,9980,9981,9982,9983,9984,9985,9986,9987,9988,9989}. LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 (full sequence) Eric Weisstein, LexicographicOrder Wikipedia, Lexicographical order EXAMPLE a(13) = 1008; a(14) = 1009; a(15) = 101; a(16) = 1010; a(17) = 1011; largest term a(5) = 10000; last term a(10000) = 9999, largest term lexicographically. PROG (Haskell) import Data.Ord (comparing) import Data.List (sortBy) a190016 n = a190016_list !! (n-1) a190016_list = sortBy (comparing show) [1..10000] (PARI) eval(Set(vector(10^4, n, Str(n)))) \\ M. F. Hasler, Oct 25 2019 CROSSREFS Cf. A119589 (same for 1..100); A190126 (base 2), A190128 (base 3), A190130 (base 8), A190132 (base 12), A190134 (base 16). Sequence in context: A125904 A272502 A276596 * A115796 A136857 A136866 Adjacent sequences:  A190013 A190014 A190015 * A190017 A190018 A190019 KEYWORD nonn,base,fini,full AUTHOR Reinhard Zumkeller, May 06 2011 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 18 23:16 EDT 2021. Contains 347548 sequences. (Running on oeis4.)