Voozh

A389647

a(n) is the smallest k > n such that prime(k) contains the digits of prime(n) as a substring.

9, 6, 16, 7, 30, 30, 40, 43, 48, 50, 32, 33, 53, 83, 69, 71, 72, 89, 39, 58, 40, 41, 61, 77, 45, 170, 173, 683, 182, 319, 206, 215, 220, 222, 238, 190, 248, 192, 448, 270, 327, 194, 293, 196, 298, 301, 318, 200, 338, 201, 345, 333, 358, 335, 376, 382, 337, 395

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

LINKS

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

FORMULA

a(n) = A000720(A064735(n)).

EXAMPLE

a(10) = 50 since prime(10) = 29 and prime(50) = 229.

a(28) = 683 since prime(28) = 107 and prime(683) = 5107.

MATHEMATICA

Table[k = n + 1; While[Length@SequencePosition[IntegerDigits[Prime[k]], IntegerDigits[Prime[n]]] == 0, k++]; k, {n, 68}]