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!)
A020966 a(n) = Sum_{k>=1} floor(n*sqrt(2)^(2-k)). 1
2, 6, 11, 15, 19, 25, 27, 34, 38, 43, 45, 53, 57, 60, 65, 72, 78, 81, 84, 91, 93, 98, 105, 110, 114, 119, 123, 127, 133, 137, 139, 149, 152, 160, 162, 167, 172, 175, 179, 187, 189, 194, 198, 204, 206, 216, 219, 225, 230, 234, 240, 244, 247, 253, 255, 262, 268, 273, 275, 281, 285, 288 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
C. Kimberling, Problem 10520, Amer. Math. Mon. 103 (1996) p. 347.
MATHEMATICA
Table[Sum[Floor[n*Sqrt[2]^(2 - k)], {k, 1, 1000}], {n, 1, 50}] (* G. C. Greubel, May 31 2018 *)
PROG
(PARI) for(n=1, 30, print1(sum(k=1, 1000, floor(n*sqrt(2)^(2-k))), ", ")) \\ G. C. Greubel, May 31 2018
(Magma) [(&+[Floor(n*Sqrt(2)^(2-k)): k in [1..1000]]): n in [1..30]]; // G. C. Greubel, May 31 2018
CROSSREFS
Sequence in context: A035487 A299637 A190889 * A193910 A215918 A078476
KEYWORD
nonn
AUTHOR
EXTENSIONS
Terms a(31) onward added by G. C. Greubel, May 31 2018
STATUS
approved

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 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)