

A214741


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


2



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, 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, 56, 57, 37, 59, 8, 8, 22, 63, 31, 23, 32, 66, 9, 9, 34, 25, 72, 73, 26, 10, 10, 10
(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 7#13, 6#14, 515, so a(8) = 3.


MATHEMATICA

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


CROSSREFS

Cf. A214742.
Sequence in context: A068449 A068450 A071436 * A243487 A143485 A181633
Adjacent sequences: A214738 A214739 A214740 * A214742 A214743 A214744


KEYWORD

nonn,easy


AUTHOR

Clark Kimberling, Jul 28 2012


STATUS

approved



