login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Least m>0 such that n-m divides prime(n)+prime(m).
2

%I #5 Aug 01 2012 14:11:35

%S 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,

%T 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,

%U 9,36,18,14,45,24,9,2,18,32,8,14,29,26,23,19,54,44,47,24,15,20

%N Least m>0 such that n-m divides prime(n)+prime(m).

%H Clark Kimberling, <a href="/A214743/b214743.txt">Table of n, a(n) for n = 2..1000</a>

%e Write x#y if x|y is false; then 8#25, 7#26, 6#28, 5#30, so a(9) = 4.

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

%Y Cf. A214737.

%K nonn,easy

%O 2,2

%A _Clark Kimberling_, Jul 28 2012