The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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.). 8

%I

%S 13,29,31,41,47,53,61,79,83,97,101,103,107,109,113,163,227,229,241,

%T 263,269,281,307,331,347,367,401,449,463,487,503,509,521,523,541,547,

%U 557,563,569,587,601,607,641,647,661,701,709,743,769,787,809,821,823,829

%N 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.).

%C Conjecture: Sequence is infinite. Subsidiary sequence: number of n-digit members.

%H Harvey P. Dale, <a href="/A087593/b087593.txt">Table of n, a(n) for n = 0..1000</a>

%e 29 is a member as absolute(2-9) = 7 is a prime.

%e 101 is a member as 1~0= 1, 0~1 = 1 and dd(101) = 11 is a prime.

%t Select[Prime[Range[200]],PrimeQ[FromDigits[Abs[Differences[ IntegerDigits[ #]]]]]&] (* _Harvey P. Dale_, Oct 10 2014 *)

%Y Cf. A087594, A087595.

%K base,nonn

%O 0,1

%A _Amarnath Murthy_, Sep 18 2003

%E More terms from _David Wasserman_, Jun 15 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 1 04:13 EDT 2022. Contains 354951 sequences. (Running on oeis4.)