cp's OEIS Frontend

A210758 Primes less than 1000 sorted lexicographically in decimal representation.

%I A210758 #20 Feb 16 2025 08:33:17
%S A210758 101,103,107,109,11,113,127,13,131,137,139,149,151,157,163,167,17,173,
%T A210758 179,181,19,191,193,197,199,2,211,223,227,229,23,233,239,241,251,257,
%U A210758 263,269,271,277,281,283,29,293,3,307,31,311,313,317,331,337,347,349
%N A210758 Primes less than 1000 sorted lexicographically in decimal representation.
%C A210758 The sequence is finite with 168 terms, A006880(3) = 168.
%H A210758 Reinhard Zumkeller, <a href="/A210758/b210758.txt">Table of n, a(n) for n = 1..168</a> all terms
%H A210758 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/LexicographicOrder.html">Lexicographic Order</a>
%H A210758 Wikipedia, <a href="http://en.wikipedia.org/wiki/Lexicographical_order">Lexicographical order</a>
%e A210758 a(26) = 2; a(45) = 3; a(84) = 5; a(119) = 7;
%e A210758 a(1) = A000040(26) = 101, first term;
%e A210758 a(168) = A000040(168) = 997, last term.
%o A210758 (Haskell)
%o A210758 import Data.List (sortBy)
%o A210758 import Data.Function (on)
%o A210758 a210758 n = a210758_list !! (n-1)
%o A210758 a210758_list = sortBy (compare `on` show) $
%o A210758                       takeWhile (<= 1000) a000040_list
%o A210758 -- _Reinhard Zumkeller_, Apr 01 2012, Mar 25 2012
%Y A210758 Cf. A000040, A210757, A210759, A210760, A210761.
%K A210758 nonn,base,fini,full
%O A210758 1,1
%A A210758 _Reinhard Zumkeller_, Mar 25 2012