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!)
A174059 a(n) = ceiling(Sum_{k=1..n} sqrt(k)). 1

%I #11 May 06 2019 14:28:52

%S 0,1,3,5,7,9,11,14,17,20,23,26,30,33,37,41,45,49,53,58,62,67,71,76,81,

%T 86,91,96,102,107,113,118,124,130,135,141,147,153,160,166,172,179,185,

%U 192,198,205,212,219,225,232,240,247,254,261,269,276,283,291,299,306

%N a(n) = ceiling(Sum_{k=1..n} sqrt(k)).

%H Robert Israel, <a href="/A174059/b174059.txt">Table of n, a(n) for n = 0..1000</a>

%F a(n) = 2/3*n^(3/2) + 1/2*n^(1/2) + O(1). It appears that the absolute value of the difference is always less than 1. - _Robert Israel_, May 06 2019

%p map(ceil,ListTools:-PartialSums([seq((sqrt(k)),k=0..100)])); # _Robert Israel_, May 06 2019

%t s=0;lst={};Do[s+=Sqrt[n];AppendTo[lst,Ceiling[s]],{n,0,6!}];lst

%t Ceiling[Accumulate[Sqrt[Range[0,60]]]] (* _Harvey P. Dale_, Aug 29 2016 *)

%Y Cf. A025224, A174058

%K nonn

%O 0,3

%A _Vladimir Joseph Stephan Orlovsky_, Mar 06 2010

%E Offset corrected by _Robert Israel_, May 06 2019

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 24 13:15 EDT 2024. Contains 371948 sequences. (Running on oeis4.)