A052495 - OEIS

A052495

Take n-th prime p, let P = all primes having same digits; a(n) = q-p where q is smallest prime in P >p if q exists; otherwise a(n) = p-r where r is largest prime in P <p if r exists; otherwise a(n) = 0.

0, 0, 0, 0, 0, 18, 54, 0, 0, 0, 18, 36, 0, 0, 0, 0, 0, 0, 0, 54, 36, 18, 0, 0, 18, 0, 0, 594, 0, 18, 144, 180, 36, 54, 270, 0, 414, 450, 450, 144, 18, 630, 720, 54, 522, 720, 0, 0, 0, 0, 0, 54, 180, 270, 0, 0, 0, 144, 450, 540, 540, 54, 0, 180, 18, 144, 18, 36, 396, 90, 0, 234

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

OFFSET

1,6

COMMENTS

The primes in P are required to have the same number of digits as p; thus internal 0's must remain internal 0's.

LINKS

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

EXAMPLE

a(41)=18 because the 41st prime is 179. The primes having these digits are 179, 197, 719 and 971. The distance from 179 to 197 = 18.

CROSSREFS

Cf. A052902, A052998, A052999, A053544, A052494, A052507.

Sequence in context: A334645 A133356 A367345 * A052902 A217591 A059137

Adjacent sequences: A052492 A052493 A052494 * A052496 A052497 A052498

KEYWORD

base,easy,nonn

AUTHOR

Enoch Haga, Mar 16 2000

STATUS

approved