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!)
A049474 a(n) = ceiling(n/sqrt(2)). 7

%I #14 Jul 06 2017 02:59:06

%S 0,1,2,3,3,4,5,5,6,7,8,8,9,10,10,11,12,13,13,14,15,15,16,17,17,18,19,

%T 20,20,21,22,22,23,24,25,25,26,27,27,28,29,29,30,31,32,32,33,34,34,35,

%U 36,37,37,38,39,39,40,41,42,42,43,44,44,45,46,46,47

%N a(n) = ceiling(n/sqrt(2)).

%H Reinhard Zumkeller, <a href="/A049474/b049474.txt">Table of n, a(n) for n = 0..10000</a>

%t Table[Ceiling[n/Sqrt[2]], {n,0,50}] (* _G. C. Greubel_, Jul 06 2017 *)

%o (Haskell)

%o a049474 = ceiling . (/ sqrt 2) . fromIntegral

%o -- _Reinhard Zumkeller_, Jul 01 2015

%o (PARI) a(n)=if(n,sqrtint((n^2-1)\2)+1,0) \\ _Charles R Greathouse IV_, Sep 02 2015

%Y A099188(n) = 2*a(n).

%Y Cf. A049472.

%K nonn

%O 0,3

%A _N. J. A. Sloane_

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 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)