This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A163849 Primes p such that the difference between the nearest cubes above and below p is prime. 1
 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 733, 739, 743, 751, 757, 761, 769, 773 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS There is a sequence A048763(A000040(n)) = A145446(n) of nearest cubes above the primes and a sequence A048762(A000040(n)) of nearest cubes below the primes. If the difference A145446(n) - A048762(A000040(n)) is prime, then A000040(n) is in this sequence. LINKS G. C. Greubel, Table of n, a(n) for n = 1..2500 EXAMPLE The difference of cubes 6^3 - 5^3 = 91 = 7*13 is not prime, so the primes larger than 5^3 = 125 but smaller than 6^3 = 216 are not in the sequence. MATHEMATICA f[n_]:=IntegerPart[n^(1/3)]; lst={}; Do[p=Prime[n]; If[PrimeQ[(f[p]+1)^3-f[p]^3], AppendTo[lst, p]], {n, 6!}]; lst CROSSREFS Cf. A111252, A145446. Sequence in context: A095316 A095313 A095285 * A124591 A164837 A069675 Adjacent sequences:  A163846 A163847 A163848 * A163850 A163851 A163852 KEYWORD nonn,easy AUTHOR Vladimir Joseph Stephan Orlovsky, Aug 05 2009 EXTENSIONS Edited by R. J. Mathar, Aug 12 2009 STATUS approved

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

Last modified December 6 21:48 EST 2019. Contains 329809 sequences. (Running on oeis4.)