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

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A172336 a(n) = floor(n*(sqrt(13)+sqrt(2))). 15
 0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 100, 105, 110, 115, 120, 125, 130, 135, 140, 145, 150, 155, 160, 165, 170, 175, 180, 185, 190, 195, 200, 205, 210, 215, 220, 225, 230, 235, 240, 245, 250, 256, 261, 266, 271, 276 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS a(n) = integer part of n*(sqrt(13)+sqrt(2)), where the constant is the largest root of x^4 -30*x^2 +121. LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..1000 MATHEMATICA With[{c = Sqrt[13] + Sqrt[2]}, Floor[c Range[0, 70]]] (* Vincenzo Librandi, Aug 01 2013 *) PROG (Magma) [Floor(n*(Sqrt(13)+Sqrt(2))): n in [0..60]]; (PARI) for(n=0, 50, print1(floor(n*(sqrt(13)+sqrt(2))), ", ")) \\ G. C. Greubel, Jul 05 2017 CROSSREFS Cf. A110117, A172323-A172332, A172334, A172337, A172338. Sequence in context: A248359 A008587 A008706 * A140233 A172328 A330003 Adjacent sequences: A172333 A172334 A172335 * A172337 A172338 A172339 KEYWORD nonn,less,easy AUTHOR Vincenzo Librandi, Feb 01 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.

Last modified December 1 23:44 EST 2022. Contains 358485 sequences. (Running on oeis4.)