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.

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,1

Links

Table of n, a(n) for n=0..50.

Crossrefs

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

Sequence in context: A117837 A176929 A330563 * A128717 A111348 A081649

Adjacent sequences: A060397 A060398 A060399 * A060401 A060402 A060403

Keyword

base,easy,nonn

Author

N. J. A. Sloane, Apr 04 2001

Extensions

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

Status

approved