login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A052507 Take n-th palindromic 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. 2
0, 0, 0, 0, 0, 0, 18, 180, 180, 0, 630, 630, 720, 720, 18, 18, 0, 36, 360, 360, 0, 450, 450, 180, 180, 90, 90, 180, 180, 720, 72, 72, 0, 198, 702, 1998, 17010, 17010, 39600, 900, 900, 540, 5400, 44100, 900, 900, 18, 180, 180, 0, 180, 1800, 9900, 17100, 17100 (list; graph; refs; listen; history; internal format)
OFFSET

1,7

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.

EXAMPLE

a(8)=180 because the distance from 131 to 311 is 180.

CROSSREFS

Cf. A052495, A052480.

Sequence in context: A010970 A126920 A022583 * A071910 A121038 A004410

Adjacent sequences:  A052504 A052505 A052506 * A052508 A052509 A052510

KEYWORD

base,easy,nonn

AUTHOR

Enoch Haga (Enokh(AT)comcast.net), Mar 17 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 20:47 EST 2012. Contains 205965 sequences.