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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A190333 n + [n*r/s] + [n*t/s]; r=1, s=sqrt(3), t=1/s. 3
 1, 3, 5, 7, 8, 11, 13, 14, 17, 18, 20, 22, 24, 26, 28, 30, 31, 34, 35, 37, 40, 41, 43, 45, 47, 49, 51, 53, 54, 57, 58, 60, 63, 64, 66, 68, 70, 71, 74, 76, 77, 80, 81, 83, 85, 87, 89, 91, 93, 94, 97, 99, 100, 103, 104, 106, 108, 110, 112, 114, 116, 117, 120, 121, 123, 126, 127, 129, 131, 133, 134, 137, 139, 140, 143, 144, 146, 149, 150 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS See A190332. LINKS G. C. Greubel, Table of n, a(n) for n = 1..10000 FORMULA A190332: f(n) = n + [n*sqrt(3)] + [n/sqrt(3)]. A190333: g(n) = n + [n/sqrt(3)] + [n/3]. A190334: h(n) = 4*n + [n*sqrt(3)]. MAPLE r:=1: s:=sqrt(3): t:=1/s: seq(n+floor(n*r/s)+floor(n*t/s), n=1..80); # Muniru A Asiru, Apr 05 2018 MATHEMATICA r=1; s=3^(1/2); t=1/s; 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}] (*A190332*) Table[g[n], {n, 1, 120}] (*A190333*) Table[h[n], {n, 1, 120}] (*A190334*) PROG (PARI) for(n=1, 100, print1(n + floor(n/sqrt(3)) + floor(n/3), ", ")) \\ G. C. Greubel, Apr 04 2018 (Magma) R:=RealField(); [n + Floor(n/Sqrt(3)) + Floor(n/3): n in [1..100]]; // G. C. Greubel, Apr 04 2018 CROSSREFS Cf. A190332, A190334. Sequence in context: A050111 A090542 A260518 * A190061 A288624 A168162 Adjacent sequences: A190330 A190331 A190332 * A190334 A190335 A190336 KEYWORD nonn AUTHOR Clark Kimberling, May 08 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 21 19:14 EDT 2023. Contains 365503 sequences. (Running on oeis4.)