The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A194161 a(n) = [Sum_{k=1..n} (k*r)], where [ ]=floor, ( )=fractional part, and r=sqrt(2). 3
0, 1, 1, 2, 2, 2, 3, 3, 4, 4, 5, 6, 6, 7, 7, 8, 8, 8, 9, 9, 10, 10, 11, 12, 12, 13, 13, 14, 14, 14, 15, 15, 16, 16, 16, 17, 18, 18, 19, 19, 20, 21, 21, 22, 22, 22, 23, 24, 24, 25, 25, 25, 26, 27, 27, 28, 28, 28, 29, 30, 30, 30, 31, 31, 32, 32, 33, 33, 34, 35, 35, 36, 36 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
FORMULA
a(n) = [n(n+1)r] - Sum_{k=1..n} [k*r], where [ ]=floor and r=sqrt(2).
MATHEMATICA
r = Sqrt[2];
a[n_] := Floor[Sum[FractionalPart[k*r], {k, 1, n}]]
Table[a[n], {n, 1, 90}] (* A194161 *)
s[n_] := Sum[a[k], {k, 1, n}]
Table[s[n], {n, 1, 100}] (* A194162 *)
PROG
(PARI) a(n) = floor(sum(k=1, n, frac(k*sqrt(2)))); \\ Michel Marcus, Nov 06 2017
CROSSREFS
Cf. A194162.
Sequence in context: A135636 A025795 A219610 * A051066 A029159 A029099
KEYWORD
nonn
AUTHOR
Clark Kimberling, Aug 18 2011
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 May 20 05:07 EDT 2024. Contains 372703 sequences. (Running on oeis4.)