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!)
A194110 Sum{floor(j*sqrt(5)) : 1<=j<=n}; n-th partial sum of Beatty sequence for sqrt(5). 1

%I #11 Feb 27 2023 08:05:46

%S 2,6,12,20,31,44,59,76,96,118,142,168,197,228,261,296,334,374,416,460,

%T 506,555,606,659,714,772,832,894,958,1025,1094,1165,1238,1314,1392,

%U 1472,1554,1638,1725,1814,1905,1998,2094,2192,2292,2394,2499,2606

%N Sum{floor(j*sqrt(5)) : 1<=j<=n}; n-th partial sum of Beatty sequence for sqrt(5).

%H Robert Israel, <a href="/A194110/b194110.txt">Table of n, a(n) for n = 1..10000</a>

%p ListTools:-PartialSums([seq(floor(n*sqrt(5)),n=1..100)]); # _Robert Israel_, May 24 2020

%t c[n_] := Sum[Floor[j*Sqrt[5]], {j, 1, n}];

%t c = Table[c[n], {n, 1, 90}]

%Y Cf. A022839 (Beatty sequence for sqrt(5)).

%K nonn

%O 1,1

%A _Clark Kimberling_, Aug 15 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 May 1 10:17 EDT 2024. Contains 372163 sequences. (Running on oeis4.)