A116933 Smallest k greater than 0 such that n+k*p is a prime, where p is the smallest coprime greater than n+1.

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

Offset: 1

Author

Reinhard Zumkeller, Feb 27 2006

Keywords

• nonn

Comments

a(n) = (A116934(n) - n)/A079578(n).

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A010051, A079578.

Programs

Haskell

a116933 n = head [k | k <- [1..], a010051' (n + k * a079578 n) == 1]
-- Reinhard Zumkeller, Oct 01 2014