OFFSET
1,1
COMMENTS
This sequence is a subsequence of A002385, the palindromic primes.
The list is ordered based on the highest member of the arithmetic progression.
Some primes generate multiple progressions for different common differences.
REFERENCES
Albert H. Beiler, Recreations in the Theory of Numbers, Second Edition, Dower Publications Inc, page 222.
LINKS
Abhiram R Devesh, Table of n, a(n) for n = 1..1015
The Prime Glossary, Palindromic Primes
EXAMPLE
a(1) = p = 3. For d = 2; [p , p+d, p+2d ] = [3, 5, 7] are in arithmetic progression and are palindromic.
a(2) = p = 3. For d = 4; [p , p+d, p+2d ] = [3, 7, 11] are in arithmetic progression and are palindromic.
a(5) = p = 10501. For d = 1920; [p , p+d, p+2d ] = [10501, 12421, 14341] are in arithmetic progression and are palindromic.
a(13) = p = 10501. For d = 3840; [p , p+d, p+2d ] = [10501, 14341, 18181] are in arithmetic progression and are palindromic.
[3, 7, 11] is an instance with d>p. With first term 110909011, there are 4 instances of common difference d greater than p, yielding 3 palindromic primes in arithmetic progression: d=9914652990, 9916572990, 9925563990, 9928383990. - Michel Marcus, Jul 21 2014
PROG
(PARI) ispal(n) = eval(concat(Vecrev(Str(n)))) == n;
ispp(p) = isprime(p) && ispal(p);
isokppap(p) = {if (ispp(p), for (d=1, p-1, if (ispp(p-d) && ispp(p-2*d), return (1)); ); return (0); ); } \\ Michel Marcus, Jul 07 2014
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Abhiram R Devesh, Jun 23 2014
STATUS
approved