The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A118665 Least prime p such that n*(p#^3)-1 is prime or 0 if n is a cube so no prime possible. 0
 2, 3, 2, 2, 5, 2, 3, 0, 2, 2, 59, 2, 2, 3, 11, 2, 3, 19, 2, 401, 2, 3, 3, 2, 2, 7, 0, 2, 3, 2, 13, 3, 2, 2, 3, 7, 7, 11, 2, 5, 5, 17, 7, 5, 2, 2, 2, 3, 2, 31, 3, 13, 257, 3, 2, 2, 5, 41, 2, 3, 2, 2, 31, 2, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS EXAMPLE 1*(2^3)-1=7 prime so a(1)=2 2*(2^3)-1=15 composite 2*((2*3)^3)-1=431 prime so a(2)=3 CROSSREFS Sequence in context: A292588 A335965 A225176 * A333238 A336526 A225243 Adjacent sequences:  A118662 A118663 A118664 * A118666 A118667 A118668 KEYWORD nonn AUTHOR Pierre CAMI, May 19 2006 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 3 14:51 EST 2020. Contains 338906 sequences. (Running on oeis4.)