The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A110117 a(n) = floor(n * (sqrt(2) + sqrt(3))). 24

%I

%S 3,6,9,12,15,18,22,25,28,31,34,37,40,44,47,50,53,56,59,62,66,69,72,75,

%T 78,81,84,88,91,94,97,100,103,106,110,113,116,119,122,125,128,132,135,

%U 138,141,144,147,151,154,157,160,163,166,169,173,176,179,182,185,188

%N a(n) = floor(n * (sqrt(2) + sqrt(3))).

%C Beatty sequence for sqrt(2)+sqrt(3); complement of A110118;

%C sqrt(2)+sqrt(3) = 3.14626... = A135611, a weak but interesting Pi approximation.

%H G. C. Greubel, <a href="/A110117/b110117.txt">Table of n, a(n) for n = 1..5000</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PiApproximations.html">Pi Approximations</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/BeattySequence.html">Beatty Sequence</a>

%H <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a>

%t Table[Floor[n*(Sqrt[2] + Sqrt[3])], {n, 1, 50}] (* _G. C. Greubel_, Jul 02 2017 *)

%o (PARI) for(n=1,50, print1(floor(n*(sqrt(2) + sqrt(3))), ", ")) \\ _G. C. Greubel_, Jul 02 2017

%Y Cf. A110119, A135611.

%K nonn

%O 1,1

%A _Reinhard Zumkeller_, Jul 13 2005

%E Typo in Link section fixed by _Reinhard Zumkeller_, Feb 15 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 15 13:44 EDT 2021. Contains 343920 sequences. (Running on oeis4.)