|
|
A210758
|
|
Primes less than 1000 sorted lexicographically in decimal representation.
|
|
6
|
|
|
101, 103, 107, 109, 11, 113, 127, 13, 131, 137, 139, 149, 151, 157, 163, 167, 17, 173, 179, 181, 19, 191, 193, 197, 199, 2, 211, 223, 227, 229, 23, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 29, 293, 3, 307, 31, 311, 313, 317, 331, 337, 347, 349
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The sequence is finite with 168 terms, A006880(3) = 168.
|
|
LINKS
|
Reinhard Zumkeller, Table of n, a(n) for n = 1..168 all terms
Eric Weisstein's World of Mathematics, Lexicographic Order
Wikipedia, Lexicographical order
|
|
EXAMPLE
|
a(26) = 2; a(45) = 3; a(84) = 5; a(119) = 7;
a(1) = A000040(26) = 101, first term;
a(168) = A000040(168) = 997, last term.
|
|
PROG
|
(Haskell)
import Data.List (sortBy)
import Data.Function (on)
a210758 n = a210758_list !! (n-1)
a210758_list = sortBy (compare `on` show) $
takeWhile (<= 1000) a000040_list
-- Reinhard Zumkeller, Apr 01 2012, Mar 25 2012
|
|
CROSSREFS
|
Cf. A000040, A210757, A210759, A210760, A210761.
Sequence in context: A030474 A162199 A195469 * A225082 A327915 A131687
Adjacent sequences: A210755 A210756 A210757 * A210759 A210760 A210761
|
|
KEYWORD
|
nonn,base,fini,full
|
|
AUTHOR
|
Reinhard Zumkeller, Mar 25 2012
|
|
STATUS
|
approved
|
|
|
|