OFFSET
1,2
COMMENTS
This is one of three sequences that partition the positive integers. In general, suppose that r, s, t are positive real numbers for which the sets {i/r: i>=1}, {j/s: j>=1}, {k/t: k>=1} are pairwise disjoint. Let a(n) be the rank of n/r when all the numbers in the three sets are jointly ranked. Define b(n) and c(n) as the ranks of n/s and n/t. It is easy to prove that
a(n) = n + [n*s/r] + [n*t/r],
b(n) = n + [n*r/s] + [n*t/s],
c(n) = n + [n*r/t] + [n*s/t], where []=floor.
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..10000
FORMULA
MATHEMATICA
PROG
(PARI) for(n=1, 100, print1(n + floor(n*sin(Pi/3)/2) + floor(n/(2*sin(Pi/3))), ", ")) \\ G. C. Greubel, Jan 10 2018
(Magma) C<i> := ComplexField(); [n + Floor(n*Sin(Pi(C)/3)/2) + Floor(n/(2*Sin(Pi(C)/3))): n in [1..100]]; // G. C. Greubel, Jan 10 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
Clark Kimberling, May 04 2011
STATUS
approved