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!)
A189369 a(n) = n + [n*r/t] + [n*s/t]; r=2, s=sqrt(2), t=sqrt(3). 3

%I #9 Sep 08 2022 08:45:56

%S 2,5,8,11,14,16,20,23,26,29,31,34,38,41,44,47,49,52,55,59,62,64,67,70,

%T 73,77,80,82,85,88,91,94,97,100,103,106,109,112,115,118,121,124,127,

%U 129,132,136,139,142,145,147,150,154,157,160,162,165,168,171,175,177,180,183,186,189,193,195,198,201,204,207,209,213,216,219,222,225,227,231,234,237,240,242,245

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

%C (See A189367.)

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

%t r = 2; s = Sqrt[2]; t = Sqrt[3];

%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}] (* A189367 *)

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

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

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

%o (Magma) [n + Floor(2*n/Sqrt(3)) + Floor(n*Sqrt(2)/Sqrt(3)): n in [1..100]]; // _G. C. Greubel_, Apr 20 2018

%Y Cf. A189367, A189368.

%K nonn

%O 1,1

%A _Clark Kimberling_, Apr 20 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 19 08:45 EDT 2024. Contains 371782 sequences. (Running on oeis4.)