cp's OEIS Frontend

A214741 Least m>0 such that n-m divides L(n)+m, where L = A000201 (lower Wythoff sequence).

%I A214741 #5 Jul 31 2012 18:56:17
%S A214741 1,2,2,4,1,1,3,8,8,4,11,11,2,2,15,6,17,12,7,3,3,3,22,12,9,13,27,4,4,4,
%T A214741 31,31,33,22,34,5,5,5,14,40,41,15,21,6,6,6,23,17,24,32,18,7,7,42,54,
%U A214741 56,57,37,59,8,8,22,63,31,23,32,66,9,9,34,25,72,73,26,10,10,10
%N A214741 Least m>0 such that n-m divides L(n)+m, where L = A000201 (lower Wythoff sequence).
%H A214741 Clark Kimberling, <a href="/A214741/b214741.txt">Table of n, a(n) for n = 2..1000</a>
%e A214741 Write x#y if x|y is false; then 7#13, 6#14, 5|15, so a(8) = 3.
%t A214741 r=GoldenRatio;
%t A214741 Table[m = 1; While[! Divisible[Floor[n*r]+m, n - m], m++]; m, {n, 2, 100}]
%Y A214741 Cf. A214742.
%K A214741 nonn,easy
%O A214741 2,2
%A A214741 _Clark Kimberling_, Jul 28 2012