login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A259726
Numbers k such that [r[s*k]] > [s[r*k]], where r = sqrt(2), s=sqrt(3), and [ ] = floor.
3
2, 3, 6, 7, 9, 11, 12, 14, 26, 33, 36, 40, 41, 43, 48, 52, 55, 59, 62, 65, 67, 70, 72, 74, 77, 82, 84, 89, 91, 93, 94, 96, 101, 108, 111, 115, 118, 119, 122, 123, 125, 130, 134, 137, 140, 141, 144, 147, 148, 149, 151, 152, 154, 159, 164, 171, 175, 178, 181
OFFSET
1,1
COMMENTS
Suppose that r and s are distinct real numbers, and let f(r,s,k) = [s[r*k]] - [r[s*k]]. Let (G(n)) be the sequence of those k for which f(r,s,k) > 0, let (E(n)) be those for which f(r,s,k) = 0, and (L(n)), those for which f(r,s,k) < 0. Clearly (G(n), E(n), L(n)) partition the positive integers. In particular, A259724, A259725, A259726 partition the positive integers.
Conjecture: the limits g = lim G(n)/n, e = lim E(n)/n, el = lim L(n)/n exist; if so, then 1/g + 1/e + 1/el = 1.
LINKS
MATHEMATICA
z = 1000; r = Sqrt[2]; s = Sqrt[3];
u = Table[Floor[r*Floor[s*n]], {n, 1, z}];
v = Table[Floor[s*Floor[r*n]], {n, 1, z}];
Select[Range[400], u[[#]] < v[[#]] &] (* A259724 *)
Select[Range[200], u[[#]] == v[[#]] &] (* A259725 *)
Select[Range[200], u[[#]] > v[[#]] &] (* A259726 *)
CROSSREFS
Sequence in context: A201734 A287775 A283208 * A259587 A304107 A344954
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Jul 15 2015
STATUS
approved