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

 

Logo
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

%I #10 Sep 08 2022 08:45:57

%S 1,3,5,7,8,11,13,14,17,18,20,22,24,26,28,30,31,34,35,37,40,41,43,45,

%T 47,49,51,53,54,57,58,60,63,64,66,68,70,71,74,76,77,80,81,83,85,87,89,

%U 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

%N n + [n*r/s] + [n*t/s]; r=1, s=sqrt(3), t=1/s.

%C See A190332.

%H G. C. Greubel, <a href="/A190333/b190333.txt">Table of n, a(n) for n = 1..10000</a>

%F A190332: f(n) = n + [n*sqrt(3)] + [n/sqrt(3)].

%F A190333: g(n) = n + [n/sqrt(3)] + [n/3].

%F A190334: h(n) = 4*n + [n*sqrt(3)].

%p 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

%t r=1; s=3^(1/2); t=1/s;

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

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

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

%t Table[f[n], {n, 1, 120}] (*A190332*)

%t Table[g[n], {n, 1, 120}] (*A190333*)

%t Table[h[n], {n, 1, 120}] (*A190334*)

%o (PARI) for(n=1,100, print1(n + floor(n/sqrt(3)) + floor(n/3), ", ")) \\ _G. C. Greubel_, Apr 04 2018

%o (Magma) R:=RealField(); [n + Floor(n/Sqrt(3)) + Floor(n/3): n in [1..100]]; // _G. C. Greubel_, Apr 04 2018

%Y Cf. A190332, A190334.

%K nonn

%O 1,2

%A _Clark Kimberling_, May 08 2011

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)