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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105342 Least k such that prime(n+k) == k (mod prime(n)). 0
1, 3, 3, 8, 5, 7, 14, 21, 9, 9, 20, 11, 22, 13, 52, 15, 54, 17, 32, 47, 17, 51, 68, 78, 23, 44, 101, 67, 86, 102, 29, 62, 114, 139, 91, 151, 70, 70, 39, 39, 144, 76, 173, 125, 162, 197, 166, 88, 98, 223, 98, 53, 145, 192, 233, 104, 155, 241, 59, 110, 112, 159, 228, 334, 185 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

MATHEMATICA

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

CROSSREFS

Sequence in context: A016606 A069462 A097469 * A021751 A199624 A093366

Adjacent sequences:  A105339 A105340 A105341 * A105343 A105344 A105345

KEYWORD

nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), Apr 30 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 15:31 EST 2012. Contains 205633 sequences.