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!)
A198081 a(n) = ceiling(n*sqrt(3)). 1

%I #17 Jul 29 2022 20:44:17

%S 0,2,4,6,7,9,11,13,14,16,18,20,21,23,25,26,28,30,32,33,35,37,39,40,42,

%T 44,46,47,49,51,52,54,56,58,59,61,63,65,66,68,70,72,73,75,77,78,80,82,

%U 84,85,87,89,91,92,94,96,97,99,101,103

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

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

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

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

%o (Python)

%o from math import isqrt

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

%Y Cf. A022847.

%K nonn,easy

%O 0,2

%A _Vincenzo Librandi_, Oct 22 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 18:58 EDT 2024. Contains 371798 sequences. (Running on oeis4.)