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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A116933 Smallest k greater than 0 such that n+k*p is a prime, where p is the smallest coprime greater than n+1. 3
 2, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 2, 1, 4, 3, 6, 1, 2, 1, 2, 1, 2, 1, 2, 3, 10, 1, 8, 1, 2, 1, 2, 1, 2, 5, 4, 1, 8, 1, 2, 1, 4, 7, 2, 3, 8, 1, 2, 1, 2, 1, 2, 1, 4, 3, 4, 3, 2, 1, 4, 1, 2, 1, 2, 1, 8, 1, 2, 9, 6, 1, 2, 1, 2, 3, 8, 7, 2, 1, 10, 1, 6, 1, 4, 3, 4, 1, 2, 7, 2, 7, 2, 1, 6, 1, 6, 1, 4, 3, 2, 11, 2, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(n) = (A116934(n) - n)/A079578(n). LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 PROG (Haskell) a116933 n = head [k | k <- [1..], a010051' (n + k * a079578 n) == 1] -- Reinhard Zumkeller, Oct 01 2014 CROSSREFS Cf. A010051, A079578. Sequence in context: A216320 A308455 A214716 * A354060 A194448 A238950 Adjacent sequences: A116930 A116931 A116932 * A116934 A116935 A116936 KEYWORD nonn AUTHOR Reinhard Zumkeller, Feb 27 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 19 17:24 EDT 2024. Contains 373504 sequences. (Running on oeis4.)