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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A214737 Least m>0 such that n-m divides prime(n)+m. 3
1, 1, 3, 1, 5, 1, 5, 1, 7, 4, 5, 4, 11, 13, 13, 13, 17, 17, 7, 19, 21, 21, 23, 23, 25, 1, 1, 6, 17, 29, 31, 16, 33, 12, 19, 35, 35, 37, 37, 19, 41, 4, 41, 23, 11, 4, 47, 3, 19, 47, 49, 4, 49, 3, 27, 55, 11, 3, 29, 18, 57, 26, 39, 2, 65, 65, 23, 17, 69, 18, 71, 18, 71, 73 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,3

LINKS

Clark Kimberling, Table of n, a(n) for n = 2..1000

EXAMPLE

Write x#y if x|y is false; then 9#30, 8#31, 7#32, 6#33, 5#34, 4#35, 3#36, so a(10) = 7.

MATHEMATICA

Table[m = 1; While[! Divisible[Prime[n]+m, n - m], m++]; m, {n, 2, 100}]

CROSSREFS

Cf. A075861.

Sequence in context: A208239 A114567 A001051 * A046730 A002972 A324896

Adjacent sequences:  A214734 A214735 A214736 * A214738 A214739 A214740

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Jul 28 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 24 11:23 EDT 2019. Contains 323529 sequences. (Running on oeis4.)