A215430 Smallest integer m such that prime(m) == m (mod prime(n)).

3, 4, 7, 6, 8, 21, 20, 10, 36, 14, 65, 16, 47, 18, 53, 57, 85, 63, 130, 58, 153, 28, 30, 49, 108, 55, 97, 222, 59, 82, 157, 161, 276, 42, 44, 156, 106, 193, 112, 228, 50, 87, 420, 395, 54, 517, 136, 101, 288, 484, 105, 407, 300, 66, 158, 117, 68, 254, 123

Offset

1,1

Comments

Smallest integer m such that (prime(m)-m) is divisible by prime(n).

Links

Zak Seidov, Table of n, a(n) for n = 1..10000

Example

n=1: q=prime(n)=2, m=3, p=prime(m)=5, (p-q)=2, (p-m)/q=1, hence a(1)=3
n=2: q=3, m=4, p=7, (p-q)=3, (p-m)/q=1, hence a(2)=4
n=3: q=5, m=7, p=17, (p-q)=10, (p-m)/q=2, hence a(3)=7.

Mathematica

Reap[Do[q=Prime[n]; m=1; p=2; While[Mod[Prime[m]-m, q]>0, m++]; Sow[m], {n, 100}]][[2, 1]]

Crossrefs

Sequence in context: A086455 A204823 A211657 * A096842 A147966 A351923

Adjacent sequences: A215427 A215428 A215429 * A215431 A215432 A215433

Keyword

nonn

Author

Zak Seidov, Aug 10 2012

Status

approved