login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A214743 Least m>0 such that n-m divides prime(n)+prime(m). 2
1, 2, 1, 3, 1, 2, 1, 4, 2, 5, 2, 2, 4, 7, 2, 11, 2, 7, 6, 2, 8, 14, 18, 23, 14, 7, 12, 5, 8, 7, 22, 20, 10, 29, 23, 16, 4, 8, 4, 8, 14, 8, 4, 22, 9, 17, 19, 8, 12, 27, 30, 9, 16, 19, 24, 32, 9, 9, 36, 18, 14, 45, 24, 9, 2, 18, 32, 8, 14, 29, 26, 23, 19, 54, 44, 47, 24, 15, 20 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,2
LINKS
EXAMPLE
Write x#y if x|y is false; then 8#25, 7#26, 6#28, 5#30, so a(9) = 4.
MATHEMATICA
Table[m = 1; While[! Divisible[Prime[n]+Prime[m], n-m], m++]; m, {n, 2, 100}]
CROSSREFS
Cf. A214737.
Sequence in context: A286552 A324826 A277892 * A331179 A026100 A059127
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 01:36 EDT 2024. Contains 371264 sequences. (Running on oeis4.)