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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A198263 a(n) = ceiling(n*sqrt(8)). 1

%I #16 Jul 29 2022 21:46:30

%S 0,3,6,9,12,15,17,20,23,26,29,32,34,37,40,43,46,49,51,54,57,60,63,66,

%T 68,71,74,77,80,83,85,88,91,94,97,99,102,105,108,111,114,116,119,122,

%U 125,128,131,133,136,139,142,145,148,150,153,156,159

%N a(n) = ceiling(n*sqrt(8)).

%H Vincenzo Librandi, <a href="/A198263/b198263.txt">Table of n, a(n) for n = 0..10000</a>

%t Ceiling[Range[0,60]Sqrt[8]] (* _Harvey P. Dale_, May 05 2012 *)

%o (Magma) [Ceiling(n*Sqrt(8)): n in [0..60]]

%o (Python)

%o from math import isqrt

%o def A198263(n): return 1+isqrt(n*n<<3) if n else 0 # _Chai Wah Wu_, Jul 29 2022

%Y Cf. A022842, A022851.

%K nonn

%O 0,2

%A _Vincenzo Librandi_, Oct 24 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 02:12 EDT 2024. Contains 371782 sequences. (Running on oeis4.)