A087593 Define dd(n) = the number formed by concatenating the absolute difference of successive digits. Sequence contains primes p such that dd(p) is also prime. (Primes in which the number formed by successive digit difference is also a prime.).
13, 29, 31, 41, 47, 53, 61, 79, 83, 97, 101, 103, 107, 109, 113, 163, 227, 229, 241, 263, 269, 281, 307, 331, 347, 367, 401, 449, 463, 487, 503, 509, 521, 523, 541, 547, 557, 563, 569, 587, 601, 607, 641, 647, 661, 701, 709, 743, 769, 787, 809, 821, 823, 829
Offset: 0
Examples
29 is a member as absolute(2-9) = 7 is a prime. 101 is a member as 1~0= 1, 0~1 = 1 and dd(101) = 11 is a prime.
Links
- Harvey P. Dale, Table of n, a(n) for n = 0..1000
Programs
-
Mathematica
Select[Prime[Range[200]],PrimeQ[FromDigits[Abs[Differences[ IntegerDigits[ #]]]]]&] (* Harvey P. Dale, Oct 10 2014 *)
Extensions
More terms from David Wasserman, Jun 15 2005
Comments