A084199 Smallest prime q<prime(n) such that q+1 divides prime(n)+1, a(n)=1 if no such q exists.

1, 1, 2, 3, 2, 1, 2, 3, 2, 2, 3, 1, 2, 3, 2, 2, 2, 1, 3, 2, 1, 3, 2, 2, 13, 2, 3, 2, 1, 2, 3, 2, 2, 3, 2, 3, 1, 3, 2, 2, 2, 13, 2, 1, 2, 3, 3, 3, 2, 1, 2, 2, 1, 2, 2, 2, 2, 3, 1, 2, 3, 2, 3, 2, 1, 2, 3, 1, 2, 13, 2, 2, 3, 1, 3, 2, 2, 1, 2, 1, 2, 1, 2, 13, 3, 2, 2, 1, 2, 3, 2, 2, 3, 2, 3, 2, 2, 2, 3, 1, 3, 2, 2

Offset

1,3

Comments

a(n)=1 iff A084196(n)=0;

conjecture: A008578 = range of values > 1.

Links

Table of n, a(n) for n=1..103.

Crossrefs

Sequence in context: A068073 A324504 A032452 * A277745 A353497 A320858

Adjacent sequences: A084196 A084197 A084198 * A084200 A084201 A084202

Keyword

nonn

Author

Reinhard Zumkeller, May 18 2003

Status

approved