|
%I #11 Jul 31 2015 04:28:18
%S 1,3,2,1,1,10,4,13,2,2,9,10,20,3,3,26,10,29,4,4,12,36,13,5,20,42,43,
%T 35,6,49,49,52,7,7,20,28,21,8,8,65,23,68,9,9,72,75,75,10,10,39,29,84,
%U 11,11,31,91,32,12,95,97,98,48,13,50,104,107,14,14,39,91,40,15
%N Least m>0 such that L(n)-m divides U(n)+m, where L = A000201 and U = A001950 (lower and upper Wythoff sequences).
%H Clark Kimberling, <a href="/A214742/b214742.txt">Table of n, a(n) for n = 2..1000</a>
%e Write x#y if x|y is false; then 11#21, 10#22, 9#23, 8|24, so a(8) = 4.
%t r=GoldenRatio;
%t Table[m = 1; While[! Divisible[Floor[n*r^2]+m, Floor[n*r] - m], m++]; m, {n, 2, 100}]
%Y Cf. A214741.
%K nonn,easy
%O 2,2
%A _Clark Kimberling_, Jul 28 2012
%E Typo in name corrected by _Clark Kimberling_, Jul 22 2015
|
