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.

A060400 In base ten, we try to get the digits 0,1,2,3,...,9,0,1,2,3,... in order only using a sequence of increasing primes and each time choosing the smallest prime that will give the desired digit.

Original entry on oeis.org

101, 103, 127, 131, 149, 151, 163, 167, 181, 191, 307, 311, 421, 431, 433, 457, 461, 467, 487, 491, 503, 521, 523, 563, 641, 653, 659, 673, 683, 691, 701, 719, 727, 733, 743, 751, 761, 769, 787, 797, 809, 811, 821, 823, 941, 953, 967, 971, 983, 991, 1009
Offset: 0

Views

Author

N. J. A. Sloane, Apr 04 2001

Keywords

Crossrefs

A060400(n) = A060399(n+9). Cf. A060915, A060916.

Extensions

More terms from Larry Reeves (larryr(AT)acm.org), Apr 09 2001