The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A330185 a(n) = n + floor(ns/r) + floor(nt/r), where r = tau - 1/2, s = tau, t = tau + 1/2, tau = golden ratio = (1+sqrt(5))/2. 2
 3, 7, 12, 16, 21, 25, 30, 34, 39, 42, 46, 51, 55, 60, 64, 69, 73, 78, 81, 85, 90, 94, 99, 103, 108, 112, 117, 121, 124, 129, 133, 138, 142, 147, 151, 156, 160, 163, 168, 172, 177, 181, 186, 190, 195, 199, 204, 207, 211, 216, 220, 225, 229, 234, 238, 243, 246 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 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 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+[ns/r]+[nt/r], b(n)=n+[nr/s]+[nt/s], c(n)=n+[nr/t]+[ns/t], where []=floor. Taking r = tau - 1/2, s = tau, t = tau + 1/2 yields a=A330185, b=A016789, c=A330186. LINKS Table of n, a(n) for n=1..57. FORMULA a(n) = n + floor(ns/r) + floor(nt/r), where r = tau - 1/2, s = tau, t = tau + 1/2. MATHEMATICA tau = GoldenRatio; r = tau - 1/2; s = tau; t = tau + 1/2; a[n_] := n + Floor[n*s/r] + Floor[n*t/r]; b[n_] := n + Floor[n*r/s] + Floor[n*t/s]; c[n_] := n + Floor[n*r/t] + Floor[n*s/t] Table[a[n], {n, 1, 120}] (* A330185 *) Table[b[n], {n, 1, 120}] (* A016789 *) Table[c[n], {n, 1, 120}] (* A330186 *) CROSSREFS Cf. A016789, A330186. Sequence in context: A310242 A310243 A286923 * A330181 A184917 A084582 Adjacent sequences: A330182 A330183 A330184 * A330186 A330187 A330188 KEYWORD nonn,easy AUTHOR Clark Kimberling, Jan 05 2020 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 24 20:07 EDT 2024. Contains 374585 sequences. (Running on oeis4.)