A095925 Smallest m such that prime(n) mod m > 1.

3, 4, 3, 4, 3, 5, 3, 4, 3, 3, 4, 5, 3, 4, 3, 3, 3, 7, 4, 3, 5, 4, 3, 3, 5, 3, 4, 3, 5, 3, 4, 3, 3, 4, 3, 4, 5, 4, 3, 3, 3, 7, 3, 5, 3, 4, 4, 4, 3, 5, 3, 3, 7, 3, 3, 3, 3, 4, 5, 3, 4, 3, 4, 3, 5, 3, 4, 5, 3, 5, 3, 3, 4, 5, 4, 3, 3, 5, 3, 5, 3, 8, 3, 5, 4, 3, 3, 5, 3, 4, 3, 3, 4, 3, 4, 3, 3, 3, 4, 7, 4, 3

Offset

1,1

Links

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

Example

A000040(25)=97: 97 mod 1 = 0, 97 mod 2 = 1, 97 mod 3 = 1, 97
mod 4 = 1, but 97 mod 5 = 2>1, therefore a(25)=5.

Mathematica

smp1[n_]:=Module[{m=2}, While[Mod[n, m]<2, m++]; m]; smp1/@Prime[Range[120]] (* Harvey P. Dale, Aug 04 2021 *)

Crossrefs

Sequence in context: A108026 A010702 A345439 * A242744 A066783 A046536

Adjacent sequences: A095922 A095923 A095924 * A095926 A095927 A095928

Keyword

nonn

Author

Reinhard Zumkeller, Jul 12 2004

Status

approved