A087583 Distinct primes such that the absolute values of successive differences are distinct palindromes. a(n+1) is chosen to be < a(n) if such a prime exists, minimizing a(n)-a(n+1); otherwise the minimal a(n+1) > a(n) is chosen.

2, 3, 5, 11, 7, 29, 37, 103, 59, 271, 19, 107, 349, 127, 359, 157, 419, 137, 409, 701, 277, 691, 257, 661, 197, 641, 167, 773, 97, 733, 239, 1087, 461, 1117, 431, 1097, 643, 1259, 613, 1451, 967, 149, 977, 281, 2393, 61, 919, 41, 929, 31, 839, 3061, 619, 1487

Offset: 0

Author

Amarnath Murthy, Sep 17 2003

Keywords

• base
• nonn
• easy

Comments

The sequence of absolute differences is 1,2,6,4,22,8,66,44.... Conjecture: this sequence is infinite and contains every even palindrome.

Examples

			a(3) = 11: |11-5| = 6, a palindrome. The primes < 5 are excluded because they have already occurred in the sequence. 7 is excluded because |7-5| = 2 has already occurred as a difference.
		

Crossrefs

Cf. A087581, A087582.

Extensions

Edited and extended by David Wasserman, Jun 14 2005