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

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

%S 3,6,9,13,16,19,22,26,30,33,36,40,43,46,49,53,57,60,63,67,70,73,76,80,

%T 83,87,90,94,97,100,103,107,110,114,117,121,124,127,130,134,137,140,

%U 144,148,151,154,157,161,164,167,171,175,178,181,184,188,191,194,197,202,205,208,211,215,218,221,224,229,232,235,238,242,245,248

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

%C See A190361.

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

%F A190361: f(n) = n + [n*sqrt(5/4)] + [n*sqrt(4/5)].

%F A190362: g(n) = n + [n*sqrt(4/5)] + [4*n/5].

%F A190363: h(n) = 2*n + [n*sqrt(5/4)] + [n/4].

%t r=1; s=(5/4)^(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}] (* A190361 *)

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

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

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

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

%Y Cf. A190361, A190362.

%K nonn

%O 1,1

%A _Clark Kimberling_, May 09 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 25 07:41 EDT 2024. Contains 371964 sequences. (Running on oeis4.)