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!)
A194815 Number of integers k in [1,n] such that {n*r+k*r} < {n*r-k*r}, where { } = fractional part and r=sqrt(2). 2
0, 1, 2, 2, 2, 2, 3, 4, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 11, 11, 12, 13, 14, 14, 14, 14, 14, 15, 16, 16, 16, 16, 17, 18, 19, 19, 19, 20, 21, 22, 23, 23, 23, 23, 24, 25, 26, 26, 26, 27, 28, 29, 29, 29, 29, 29, 30, 31, 31, 31, 31, 32, 33, 34, 34, 34, 35, 36, 37 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
MATHEMATICA
r = Sqrt[2]; p[x_] := FractionalPart[x];
u[n_, k_] := If[p[n*r + k*r] <= p[n*r - k*r], 1, 0]
v[n_, k_] := If[p[n*r + k*r] > p[n*r - k*r], 1, 0]
s[n_] := Sum[u[n, k], {k, 1, n}]
t[n_] := Sum[v[n, k], {k, 1, n}]
Table[s[n], {n, 1, 100}] (* A194815 *)
Table[t[n], {n, 1, 100}] (* A194816 *)
CROSSREFS
Partial sums of A327177.
Sequence in context: A202276 A029115 A029101 * A029080 A147652 A058360
KEYWORD
nonn
AUTHOR
Clark Kimberling, Sep 03 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 April 25 07:07 EDT 2024. Contains 371964 sequences. (Running on oeis4.)