|
%I #3 Aug 02 2012 15:05:39
%S 1,2,1,2,2,5,5,8,9,7,2,9,13,14,9,15,2,4,19,16,21,6,22,1,25,26,7,2,18,
%T 29,17,32,33,31,2,11,33,16,33,6,18,25,43,8,45,9,2,1,49,50,7,4,18,18,
%U 47,56,3,24,58,15,61,62,47,63,10,25,67,68,69,8,22,1,67,74,39,71
%N Least m>0 such that n-m divides L(n)-m, where L = A000032 (Lucas numbers).
%H Clark Kimberling, <a href="/A214968/b214968.txt">Table of n, a(n) for n = 2..1000</a>
%e Write x#y if x|y is false; then 7#46, 6#45, 5#44, 4#43, 3|42 so a(8) = 5.
%t Table[m = 1; While[! Divisible[LucasL[n]-m, n-m], m++]; m, {n, 2, 100}]
%Y Cf. A214967.
%K nonn,easy
%O 2,2
%A _Clark Kimberling_, Jul 31 2012
|
