cp's OEIS Frontend

A210759 Primes less than 10000 sorted lexicographically in decimal representation.

%I A210759 #20 Feb 16 2025 08:33:17
%S A210759 1009,101,1013,1019,1021,103,1031,1033,1039,1049,1051,1061,1063,1069,
%T A210759 107,1087,109,1091,1093,1097,11,1103,1109,1117,1123,1129,113,1151,
%U A210759 1153,1163,1171,1181,1187,1193,1201,1213,1217,1223,1229,1231,1237,1249,1259,127
%N A210759 Primes less than 10000 sorted lexicographically in decimal representation.
%C A210759 The sequence is finite with 1229 terms, A006880(4) = 1229.
%H A210759 Reinhard Zumkeller, <a href="/A210759/b210759.txt">Table of n, a(n) for n = 1..1229</a> all terms
%H A210759 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/LexicographicOrder.html">Lexicographic Order</a>
%H A210759 Wikipedia, <a href="http://en.wikipedia.org/wiki/Lexicographical_order">Lexicographical order</a>
%e A210759 a(161) = 2; a(307) = 3; a(585) = 5; a(851) = 7;
%e A210759 a(1) = A000040(169) = 1009, first term;
%e A210759 a(1229) = A000040(1229) = 9973, last term.
%o A210759 (Haskell)
%o A210759 import Data.List (sortBy)
%o A210759 import Data.Function (on)
%o A210759 a210759 n = a210759_list !! (n-1)
%o A210759 a210759_list = sortBy (compare `on` show) $
%o A210759                       takeWhile (<= 10^4) a000040_list
%o A210759 -- _Reinhard Zumkeller_, Apr 01 2012, Mar 25 2012
%Y A210759 Cf. A000040, A210757, A210758, A210760, A210761.
%K A210759 nonn,base,fini,full
%O A210759 1,1
%A A210759 _Reinhard Zumkeller_, Mar 25 2012