cp's OEIS Frontend

A210761 Primes less than 1000000 sorted lexicographically in decimal representation.

%I A210761 #20 Feb 16 2025 08:33:17
%S A210761 100003,100019,100043,100049,100057,100069,10007,10009,100103,100109,
%T A210761 100129,100151,100153,100169,100183,100189,100193,100207,100213,
%U A210761 100237,100267,100271,100279,100291,100297,100313,100333,100343,100357,100361,100363,10037
%N A210761 Primes less than 1000000 sorted lexicographically in decimal representation.
%C A210761 The sequence is finite with 78498 terms, A006880(6) = 78498.
%H A210761 Reinhard Zumkeller, <a href="/A210761/b210761.txt">Table of n, a(n) for n = 1..78498</a> all terms
%H A210761 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/LexicographicOrder.html">Lexicographic Order</a>
%H A210761 Wikipedia, <a href="http://en.wikipedia.org/wiki/Lexicographical_order">Lexicographical order</a>
%e A210761 a(9586) = 2; a(18728) = 3; a(36435) = 5; a(53508) = 7;
%e A210761 a(1) = A000040(9593) = 100003, first term;
%e A210761 a(78498) = A000040(78498) = 999983, last term.
%o A210761 (Haskell)
%o A210761 Data.List (sortBy)
%o A210761 import Data.Function (on)
%o A210761 a210761 n = a210761_list !! (n-1)
%o A210761 a210761_list = sortBy (compare `on` show) $
%o A210761                       takeWhile (<= 10^6) a000040_list
%o A210761 -- _Reinhard Zumkeller_, Apr 01 2012, Mar 25 2012
%Y A210761 Cf. A000040, A210757, A210758, A210759, A210760.
%K A210761 nonn,base,fini,full
%O A210761 1,1
%A A210761 _Reinhard Zumkeller_, Mar 25 2012