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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110117 a(n) = floor(n * (sqrt(2) + sqrt(3))). 24
3, 6, 9, 12, 15, 18, 22, 25, 28, 31, 34, 37, 40, 44, 47, 50, 53, 56, 59, 62, 66, 69, 72, 75, 78, 81, 84, 88, 91, 94, 97, 100, 103, 106, 110, 113, 116, 119, 122, 125, 128, 132, 135, 138, 141, 144, 147, 151, 154, 157, 160, 163, 166, 169, 173, 176, 179, 182, 185, 188 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Beatty sequence for sqrt(2)+sqrt(3); complement of A110118;
sqrt(2)+sqrt(3) = 3.14626... = A135611, a weak but interesting Pi approximation.
LINKS
Eric Weisstein's World of Mathematics, Pi Approximations
Eric Weisstein's World of Mathematics, Beatty Sequence
MATHEMATICA
Table[Floor[n*(Sqrt[2] + Sqrt[3])], {n, 1, 50}] (* G. C. Greubel, Jul 02 2017 *)
PROG
(PARI) for(n=1, 50, print1(floor(n*(sqrt(2) + sqrt(3))), ", ")) \\ G. C. Greubel, Jul 02 2017
CROSSREFS
Sequence in context: A262712 A195934 A195933 * A138252 A248524 A102796
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Jul 13 2005
EXTENSIONS
Typo in Link section fixed by Reinhard Zumkeller, Feb 15 2010
STATUS
approved

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 December 8 13:24 EST 2023. Contains 367679 sequences. (Running on oeis4.)