login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A189364 a(n) = n + [n*s/r] + [n*t/r]; r=1, s=sqrt(2), t=(1+sqrt(5))/2. 3
3, 7, 11, 15, 20, 23, 27, 31, 35, 40, 43, 47, 52, 55, 60, 63, 68, 72, 75, 80, 83, 88, 92, 95, 100, 104, 108, 112, 116, 120, 124, 128, 132, 137, 140, 144, 148, 152, 157, 160, 164, 168, 172, 177, 180, 185, 189, 192, 197, 200, 205, 209, 212, 217, 220, 225, 229, 233, 237, 241, 245, 249, 253, 257, 261, 265, 269, 274, 277, 281, 285, 289, 294, 297, 302, 305, 309, 314, 317, 322, 326, 329, 334 (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 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

f(n) = n + [n*s/r] + [n*t/r],

g(n) = n + [n*r/s] + [n*t/s],

h(n) = n + [n*r/t] + [n*s/t], where []=floor.

Taking r=1, s=sqrt(2), t=(1+sqrt(5))/2 gives f=A189364, g=A189365, h=A189366.

LINKS

G. C. Greubel, Table of n, a(n) for n = 1..10000

MATHEMATICA

r = 1; s = Sqrt[2]; t = (1 + Sqrt[5])/2;

f[n_] := n + Floor[n*s/r] + Floor[n*t/r];

g[n_] := n + Floor[n*r/s] + Floor[n*t/s];

h[n_] := n + Floor[n*r/t] + Floor[n*s/t]

Table[f[n], {n, 1, 120}]  (* A189364 *)

Table[g[n], {n, 1, 120}]  (* A189365 *)

Table[h[n], {n, 1, 120}]  (* A189366 *)

PROG

(PARI) for(n=1, 100, print1(n + floor(n*sqrt(2)) + floor(n*(1+sqrt(5))/2), ", ")) \\ G. C. Greubel, Apr 20 2018

(MAGMA) [n + Floor(n*Sqrt(2)) + Floor(n*(1+Sqrt(5))/2): n in [1..100]]; // G. C. Greubel, Apr 20 2018

CROSSREFS

Cf. A189365, A189366.

Sequence in context: A220520 A330165 A228436 * A022797 A190884 A310211

Adjacent sequences:  A189361 A189362 A189363 * A189365 A189366 A189367

KEYWORD

nonn

AUTHOR

Clark Kimberling, Apr 20 2011

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 18:16 EST 2021. Contains 349567 sequences. (Running on oeis4.)