cp's OEIS Frontend

A210760 Primes less than 100000 sorted lexicographically in decimal representation.

%I A210760 #20 Feb 16 2025 08:33:17
%S A210760 10007,10009,10037,10039,10061,10067,10069,10079,1009,10091,10093,
%T A210760 10099,101,10103,10111,1013,10133,10139,10141,10151,10159,10163,10169,
%U A210760 10177,10181,1019,10193,1021,10211,10223,10243,10247,10253,10259,10267,10271,10273,10289
%N A210760 Primes less than 100000 sorted lexicographically in decimal representation.
%C A210760 The sequence is finite with 9592 terms, A006880(5) = 9592.
%H A210760 Reinhard Zumkeller, <a href="/A210760/b210760.txt">Table of n, a(n) for n = 1..9592</a> all terms
%H A210760 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/LexicographicOrder.html">Lexicographic Order</a>
%H A210760 Wikipedia, <a href="http://en.wikipedia.org/wiki/Lexicographical_order">Lexicographical order</a>
%e A210760 a(1194) = 2; a(2323) = 3; a(4489) = 5; a(6557) = 7;
%e A210760 a(1) = A000040(1230) = 10007, first term;
%e A210760 a(9592) = A000040(9592) = 99991, last term.
%o A210760 (Haskell)
%o A210760 import Data.List (sortBy)
%o A210760 import Data.Function (on)
%o A210760 a210760 n = a210760_list !! (n-1)
%o A210760 a210760_list = sortBy (compare `on` show) $
%o A210760                       takeWhile (<= 10^5) a000040_list
%o A210760 -- _Reinhard Zumkeller_, Apr 01 2012, Mar 25 2012
%Y A210760 Cf. A000040, A210757, A210758, A210759, A210761.
%K A210760 nonn,base,fini,full
%O A210760 1,1
%A A210760 _Reinhard Zumkeller_, Mar 25 2012