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

 

Logo

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!)
A075862 Numbers n such that the least k such that (n-k) divides (n+k) is prime. 0
4, 5, 6, 7, 9, 10, 13, 14, 15, 19, 21, 22, 26, 31, 33, 34, 38, 39, 43, 46, 51, 57, 58, 61, 62, 69, 73, 74, 82, 86, 87, 93, 94, 103, 106, 109, 111, 118, 122, 123, 129, 134, 139, 141, 142, 146, 151, 158, 159, 166, 177, 178, 181, 183, 193, 194, 199, 201, 202, 206, 213 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

FORMULA

a(n) seems to be asymptotic to n*log(n) and a(n)<prime(n) for n>3

MATHEMATICA

plkQ[n_]:=Module[{k=2}, While[!Divisible[n+k, n-k], k++]; PrimeQ[k]]; Select[ Range[ 4, 250], plkQ] (* Harvey P. Dale, Dec 29 2018 *)

CROSSREFS

Sequence in context: A066485 A079445 A120173 * A088685 A022299 A099049

Adjacent sequences:  A075859 A075860 A075861 * A075863 A075864 A075865

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Oct 15 2002

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 December 9 22:27 EST 2019. Contains 329880 sequences. (Running on oeis4.)