A114782 Smallest prime of the form 10^k + prime(n), k >= d, the number of digits in prime(n). 0 if no such primes exist. a(n) = 0 if prime(n) + 1 == 0 (mod 3).

0, 13, 0, 17, 0, 113, 0, 1019, 0, 0, 131, 137, 0, 100043, 0, 0, 0, 1061, 167, 0, 173, 179, 0, 0, 197, 0, 1103, 0, 1109, 0, 100000127, 0, 0, 10139, 0, 1151, 100000000000000000000157, 1163, 0, 0, 0, 1181, 0, 1193, 0, 1000199, 10211, 1223, 0, 1229, 0, 0, 1000000241, 0, 0, 0, 0, 10271, 1277, 0, 1283, 0

Offset

1,2

Comments

Conjecture a(n) = 0 iff prime(n) + 1 == 0 (mod 3).

Links

Table of n, a(n) for n=1..62.

Example

a(8) = 1019 = 19 + 10^3, prime(8) = 19.

Crossrefs

Cf. A114780.

Sequence in context: A271075 A345191 A073867 * A065112 A114783 A094902

Adjacent sequences: A114779 A114780 A114781 * A114783 A114784 A114785

Keyword

base,nonn

Author

Amarnath Murthy, Nov 17 2005

Extensions

More terms from Joshua Zucker, May 06 2006

Status

approved