Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #5 Jul 31 2012 18:56:04
%S 1,2,2,4,1,2,2,8,8,10,8,8,5,14,8,10,16,12,8,8,3,22,4,16,11,20,5,28,28,
%T 20,5,8,32,34,32,4,4,38,12,40,40,24,14,34,24,22,11,16,32,14,14,36,52,
%U 36,4,56,56,52,14,12,29,62,24,64,1,2,32,62,68,58,64,6,16,74,72
%N Least m>0 such that n-m divides 2^n+m.
%H Clark Kimberling, <a href="/A214740/b214740.txt">Table of n, a(n) for n = 2..1000</a>
%e Write x#y if x|y is false; then 11#4097, 10#4098, 9#4099, 8#4100, 7#4101, 6#4102, 5#4103, 4|4104, so a(12) = 8.
%t Table[m = 1; While[! Divisible[2^(n-1)+m, n - m], m++]; m, {n, 2, 100}]
%Y Cf. A214739.
%K nonn,easy
%O 2,2
%A _Clark Kimberling_, Jul 28 2012