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!)
 A172336 a(n) = floor(n*(sqrt(13)+sqrt(2))). 15

%I

%S 0,5,10,15,20,25,30,35,40,45,50,55,60,65,70,75,80,85,90,95,100,105,

%T 110,115,120,125,130,135,140,145,150,155,160,165,170,175,180,185,190,

%U 195,200,205,210,215,220,225,230,235,240,245,250,256,261,266,271,276

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

%C a(n) = integer part of n*(sqrt(13)+sqrt(2)), where the constant is the largest root of x^4 -30*x^2 +121.

%H Vincenzo Librandi, <a href="/A172336/b172336.txt">Table of n, a(n) for n = 0..1000</a>

%t With[{c = Sqrt[13] + Sqrt[2]}, Floor[c Range[0, 70]]] (* _Vincenzo Librandi_, Aug 01 2013 *)

%o (MAGMA) [Floor(n*(Sqrt(13)+Sqrt(2))): n in [0..60]];

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

%Y Cf. A110117, A172323-A172332, A172334, A172337, A172338.

%K nonn,less,easy

%O 0,2

%A _Vincenzo Librandi_, Feb 01 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 11 00:43 EDT 2021. Contains 343784 sequences. (Running on oeis4.)