A210761 Primes less than 1000000 sorted lexicographically in decimal representation.
100003, 100019, 100043, 100049, 100057, 100069, 10007, 10009, 100103, 100109, 100129, 100151, 100153, 100169, 100183, 100189, 100193, 100207, 100213, 100237, 100267, 100271, 100279, 100291, 100297, 100313, 100333, 100343, 100357, 100361, 100363, 10037
Offset: 1
Examples
a(9586) = 2; a(18728) = 3; a(36435) = 5; a(53508) = 7; a(1) = A000040(9593) = 100003, first term; a(78498) = A000040(78498) = 999983, last term.
Links
- Reinhard Zumkeller, Table of n, a(n) for n = 1..78498 all terms
- Eric Weisstein's World of Mathematics, Lexicographic Order
- Wikipedia, Lexicographical order
Programs
-
Haskell
Data.List (sortBy) import Data.Function (on) a210761 n = a210761_list !! (n-1) a210761_list = sortBy (compare `on` show) $ takeWhile (<= 10^6) a000040_list -- Reinhard Zumkeller, Apr 01 2012, Mar 25 2012
Comments