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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A163850 Primes p such that their distance to the nearest cube above p and also their distance to the nearest cube below p are prime. 0

%I #6 Oct 16 2016 16:39:23

%S 3,127,24391,29789,328511,2460373,3048623,9393929,10503461

%N Primes p such that their distance to the nearest cube above p and also their distance to the nearest cube below p are prime.

%C The two sequences A048763(p) and A048762(p), p=A000040(n), define

%C nearest cubes above and below each prime p. If p is in A146318, the

%C distance to the larger cube, A048763(p)-p, is prime. If p is

%C in the set {3, 11, 13, 19, 29, 67,...,107, 127, 223,..}, the distance to the lower

%C cube is prime. If both of these distances are prime, we insert p into the sequence.

%e p=3 is in the sequence because the distance p-1=2 to the cube 1^3 below 3, and also the distance 8-p=5 to the cube 8=2^3 above p are prime.

%e p=127 is in the sequence because the distance p-125=2 to the cube 125=5^3 below p, and also the distance 216-p=89 to the cube 216=6^3 above p, are prime.

%t Clear[f,lst,p,n]; f[n_]:=IntegerPart[n^(1/3)]; lst={};Do[p=Prime[n];If[PrimeQ[p-f[p]^3]&&PrimeQ[(f[p]+1)^3-p],AppendTo[lst,p]],{n,9!}];lst

%t dncQ[n_]:=Module[{c=Floor[Surd[n,3]]},AllTrue[{n-c^3,(c+1)^3-n},PrimeQ]]; Select[Prime[Range[230000]],dncQ] (* The program uses the AllTrue function from Mathematica version 10 *) (* _Harvey P. Dale_, Oct 16 2016 *)

%Y Cf. A163848

%K nonn

%O 1,1

%A _Vladimir Joseph Stephan Orlovsky_, Aug 05 2009

%E Edited, first 5 entries checked by _R. J. Mathar_, Aug 12 2009

%E Two more terms (a(8) and a(9)) from _Harvey P. Dale_, Oct 16 2016

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 22 21:06 EDT 2024. Contains 371906 sequences. (Running on oeis4.)