A210759 Primes less than 10000 sorted lexicographically in decimal representation.

1009, 101, 1013, 1019, 1021, 103, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 107, 1087, 109, 1091, 1093, 1097, 11, 1103, 1109, 1117, 1123, 1129, 113, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 127

Offset: 1

Author

Reinhard Zumkeller, Mar 25 2012

Keywords

• nonn
• base
• fini
• full

Comments

The sequence is finite with 1229 terms, A006880(4) = 1229.

Examples

			a(161) = 2; a(307) = 3; a(585) = 5; a(851) = 7;
a(1) = A000040(169) = 1009, first term;
a(1229) = A000040(1229) = 9973, last term.
		

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..1229 all terms
• Eric Weisstein's World of Mathematics, Lexicographic Order
• Wikipedia, Lexicographical order

Crossrefs

Cf. A000040, A210757, A210758, A210760, A210761.

Programs

Haskell

import Data.List (sortBy)
import Data.Function (on)
a210759 n = a210759_list !! (n-1)
a210759_list = sortBy (compare `on` show) $
                      takeWhile (<= 10^4) a000040_list
-- Reinhard Zumkeller, Apr 01 2012, Mar 25 2012