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!)
A107060 a(n) = smallest number m >=0 such that n*prime(n)-m is a prime. 1
0, 1, 2, 5, 2, 5, 6, 1, 8, 7, 4, 1, 10, 1, 4, 9, 6, 1, 14, 11, 2, 5, 2, 5, 2, 5, 4, 25, 24, 1, 6, 15, 2, 3, 6, 5, 2, 21, 22, 3, 6, 11, 4, 25, 2, 3, 10, 13, 4, 3, 16, 7, 10, 1, 28, 5, 2, 35, 4, 17, 6, 17, 8, 13, 4, 1, 6, 9, 14, 9, 6, 1, 8, 19, 14, 7, 6, 17, 12, 1, 2, 3, 2, 19, 2, 15, 16, 3, 6, 1, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
MATHEMATICA
f[n_]:=Module[{pn=n Prime[n]}, pn-NextPrime[pn, -1]]; Join[{0}, Array[f, 100, 2]] (* Harvey P. Dale, Jul 21 2011 *)
CROSSREFS
Cf. A107061.
Sequence in context: A177435 A087272 A299963 * A016589 A151572 A166376
KEYWORD
nonn
AUTHOR
Zak Seidov, May 10 2005
STATUS
approved

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 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)