login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105341 Least k such that prime(n+k) == k (mod n). 0
1, 1, 2, 2, 2, 6, 7, 1, 7, 11, 8, 11, 3, 8, 11, 3, 13, 15, 3, 7, 3, 8, 16, 3, 9, 17, 13, 13, 18, 1, 7, 13, 1, 13, 23, 7, 25, 7, 7, 29, 13, 6, 24, 7, 37, 38, 6, 31, 31, 23, 33, 6, 24, 33, 44, 24, 35, 25, 4, 46, 25, 26, 47, 2, 3, 27, 49, 37, 50, 37, 1, 63, 39, 41, 41, 55, 69, 43, 69, 27, 71 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

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

MATHEMATICA

bb={}; Do[Do[If[k==Mod[Prime[n+k], n], bb=Append[bb, k]; Goto[ne]]; Label[ne], {k, n-1}], {n, 150}]; bb

CROSSREFS

Sequence in context: A292140 A064943 A081478 * A194676 A151694 A298745

Adjacent sequences:  A105338 A105339 A105340 * A105342 A105343 A105344

KEYWORD

nonn

AUTHOR

Zak Seidov, Apr 30 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 22 18:55 EST 2019. Contains 329410 sequences. (Running on oeis4.)