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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068901 Least number which when added to the n-th prime gives a multiple of n. 4
0, 1, 1, 1, 4, 5, 4, 5, 4, 1, 2, 11, 11, 13, 13, 11, 9, 11, 9, 9, 11, 9, 9, 7, 3, 3, 5, 5, 7, 7, 28, 29, 28, 31, 26, 29, 28, 27, 28, 27, 26, 29, 24, 27, 28, 31, 24, 17, 18, 21, 22, 21, 24, 19, 18, 17, 16, 19, 18, 19, 22, 17, 8, 9, 12, 13, 4, 3, 67, 1 (list; graph; refs; listen; history; internal format)
OFFSET

1,5

COMMENTS

Min{k | n divides (prime(n)+k)}.

a(n) = A068902(n) - A000040(n).

LINKS

R. Zumkeller, Table of n, a(n) for n = 1..10000 [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 16 2009]

FORMULA

n*ceil(prime(n)/n)-prime(n). - Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 06 2003

MATHEMATICA

f[n_] := Module[{p=Prime[n]}, n*Ceiling[p/n]-p]; Array[f, 100]  (* From Harvey P. Dale, Apr 06 2011 *)

CROSSREFS

A090973. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 16 2009]

Sequence in context: A125583 A196619 A063694 * A010710 A021026 A126128

Adjacent sequences:  A068898 A068899 A068900 * A068902 A068903 A068904

KEYWORD

nonn,nice

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 05 2002

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 15 14:57 EST 2012. Contains 205823 sequences.