This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A212790 (prime(n) + n) mod (prime(n) - n). 0
 0, 0, 0, 2, 4, 5, 4, 5, 4, 1, 2, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108, 110, 112, 114, 116, 118, 120, 122, 124, 126, 128 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS FORMULA a(n) = (p(n)+n) modulo (p(n)-n) = (2*n) modulo (p(n)-n). a(n) = 2*n for n > 11 because prime(n) > 3*n for n > 11. MATHEMATICA f[n_] := Block[{p = Prime[n]}, Mod[p + n, p - n]]; Array[f, 64] (* Robert G. Wilson v, May 27 2012 *) CROSSREFS Sequence in context: A123546 A317499 A004581 * A317558 A070784 A200289 Adjacent sequences:  A212787 A212788 A212789 * A212791 A212792 A212793 KEYWORD nonn AUTHOR Zak Seidov, May 27 2012 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.

Last modified December 7 00:16 EST 2019. Contains 329812 sequences. (Running on oeis4.)