cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A210760 Primes less than 100000 sorted lexicographically in decimal representation.

Original entry on oeis.org

10007, 10009, 10037, 10039, 10061, 10067, 10069, 10079, 1009, 10091, 10093, 10099, 101, 10103, 10111, 1013, 10133, 10139, 10141, 10151, 10159, 10163, 10169, 10177, 10181, 1019, 10193, 1021, 10211, 10223, 10243, 10247, 10253, 10259, 10267, 10271, 10273, 10289
Offset: 1

Views

Author

Reinhard Zumkeller, Mar 25 2012

Keywords

Comments

The sequence is finite with 9592 terms, A006880(5) = 9592.

Examples

			a(1194) = 2; a(2323) = 3; a(4489) = 5; a(6557) = 7;
a(1) = A000040(1230) = 10007, first term;
a(9592) = A000040(9592) = 99991, last term.
		

Crossrefs

Programs

  • Haskell
    import Data.List (sortBy)
    import Data.Function (on)
    a210760 n = a210760_list !! (n-1)
    a210760_list = sortBy (compare `on` show) $
                          takeWhile (<= 10^5) a000040_list
    -- Reinhard Zumkeller, Apr 01 2012, Mar 25 2012