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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A189471 a(n) = n + [n*r/t] + [n*s/t]; r=1, s=1+sqrt(2), t=1+sqrt(3). 3

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

%S 1,3,6,8,10,13,15,17,19,21,24,26,28,31,33,35,38,39,41,44,46,49,51,53,

%T 56,57,59,62,64,66,69,71,74,76,77,80,82,84,87,89,92,94,95,98,100,102,

%U 105,107,109,112,114,116,118,120,123,125,127,130,132,134,136,138,141,143,145,148,150,152,154,156,158,161,163,166,168,170,173,174,176,179,181,184,186,188

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

%C See A189469.

%H Ivan Panchenko, <a href="/A189471/b189471.txt">Table of n, a(n) for n = 1..10000</a>

%t r=1; s=1+Sqrt[2]; t=1+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}] (* A189469 *)

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

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

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

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

%Y Cf. A189469, A189470.

%K nonn

%O 1,2

%A _Clark Kimberling_, Apr 22 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.

Last modified September 7 13:22 EDT 2024. Contains 375730 sequences. (Running on oeis4.)