login
Least m>0 such that n-m divides prime(n)-prime(m).
1

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

%S 1,2,2,3,4,3,4,3,1,8,6,6,8,8,6,4,6,4,4,6,4,4,3,15,18,2,2,3,3,15,18,15,

%T 22,17,18,15,14,15,14,17,18,11,14,15,22,11,6,7,8,9,8,11,45,7,6,45,46,

%U 7,54,9,6,42,45,46,4,42,1,30,42,45,45,42,42,42,45,45,42,45,42

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

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

%e Write x#y if x|y is false; then 7#17, 6#16, 5#14, 4#12, so a(8) = 4.

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

%Y Cf. A214743, A214737.

%K nonn,easy

%O 2,2

%A _Clark Kimberling_, Jul 29 2012