login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A083656 a(n) = Sum_{i=1..n} floor(r*floor(r*i)), where r=sqrt(2). 1
1, 3, 8, 15, 24, 35, 47, 62, 78, 97, 118, 140, 165, 191, 220, 251, 284, 319, 355, 394, 435, 478, 523, 569, 618, 668, 721, 776, 833, 892, 952, 1015, 1080, 1147, 1216, 1286, 1359, 1433, 1510, 1589, 1669, 1752, 1836, 1923, 2012, 2103, 2196, 2290, 2387, 2485, 2586 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Partial sums of A007069.

LINKS

G. C. Greubel, Table of n, a(n) for n = 1..5000

FORMULA

a(n) = n*(n-1+1/sqrt(2)) + O(1).

MATHEMATICA

Table[Sum[Floor[Sqrt[2]Floor[Sqrt[2]x]], {x, n}], {n, 60}] (* Harvey P. Dale, Jul 20 2018 *)

PROG

(PARI) a(n) = sum(i=1, n, floor(sqrt(2)*floor(sqrt(2)*i))); \\ Michel Marcus, Dec 05 2013

(MAGMA) [(&+[Floor(Sqrt(2)*Floor(Sqrt(2)*j)): j in [1..n]]): n in [1..60]]; // G. C. Greubel, Oct 01 2018

CROSSREFS

Sequence in context: A157606 A191414 A086959 * A013648 A258837 A131386

Adjacent sequences:  A083653 A083654 A083655 * A083657 A083658 A083659

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Jun 13 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 20:45 EST 2019. Contains 329779 sequences. (Running on oeis4.)