

A214742


Least m>0 such that L(n)m divides U(n)+m, where L = A000201 and U = A001950 (lower and upper Wythoff sequences).


2



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, 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, 11, 11, 31, 91, 32, 12, 95, 97, 98, 48, 13, 50, 104, 107, 14, 14, 39, 91, 40, 15
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

2,2


LINKS

Clark Kimberling, Table of n, a(n) for n = 2..1000


EXAMPLE

Write x#y if xy is false; then 11#21, 10#22, 9#23, 824, so a(8) = 4.


MATHEMATICA

r=GoldenRatio;
Table[m = 1; While[! Divisible[Floor[n*r^2]+m, Floor[n*r]  m], m++]; m, {n, 2, 100}]


CROSSREFS

Cf. A214741.
Sequence in context: A240235 A092742 A316564 * A204124 A316674 A101479
Adjacent sequences: A214739 A214740 A214741 * A214743 A214744 A214745


KEYWORD

nonn,easy


AUTHOR

Clark Kimberling, Jul 28 2012


EXTENSIONS

Typo in name corrected by Clark Kimberling, Jul 22 2015


STATUS

approved



