A194387 -id:A194387 - cp's OEIS frontend

A194368 Numbers m such that Sum_{k=1..m} (<1/2 + k*r> - ) = 0, where r=sqrt(2) and < > denotes fractional part.

2, 4, 12, 14, 16, 24, 26, 28, 70, 72, 74, 82, 84, 86, 94, 96, 98, 140, 142, 144, 152, 154, 156, 164, 166, 168, 408, 410, 412, 420, 422, 424, 432, 434, 436, 478, 480, 482, 490, 492, 494, 502, 504, 506, 548, 550, 552, 560, 562, 564, 572, 574, 576, 816, 818

Offset: 1

Clark Kimberling, Aug 23 2011

nonn

Suppose that r and c are real numbers, 0 < c < 1, and
...
       s(m) = Sum_{k=1..m} ( - )
...
where < > denotes fractional part. The inequalities s(m) < 0, s(m) = 0, s(m) > 0 yield up to three sequences that partition the set of positive integers, as in the examples cited below. Of particular interest are choices of r and c for which s(m) >= 0 for every m >= 1.
.
Note that s(m) = m*c - Sum_{k=1..m} floor(c + ). This shows that if c is a rational number p/q, then the range of s(m) is a set of rational numbers having denominator q. In this case, it is easy to prove that if s(m)=0, then m is an integer multiple of q, yielding a sequence of quotients denoted by [[m/q>]] in the following list:
.
r..........p/q....s(m)<0....s(m)=0....[[m/q]]...s(m)>0
sqrt(2)....1/2....(empty)...A194368...A194369...A194370
sqrt(3)....1/2....A194371...A194372.............A194373
sqrt(5)....1/2....(empty)...A194374.............A194375
sqrt(6)....1/2....(empty)...A194376.............A194377
sqrt(7)....1/2....A194378...A194379.............A194380
sqrt(8)....1/2....A194381...A194382...A194383...A194384
sqrt(10)...1/2....(empty)...A194385.............A194386
sqrt(11)...1/2....A194387...A194388.............A194389
sqrt(12)...1/2....(empty)...A194390.............A194391
sqrt(13)...1/2....A194392...A194393.............A194394
sqrt(14)...1/2....A194395...A194396.............A194397
sqrt(15)...1/2....A194398...A194399.............A194400
tau........1/2....A194401...A194402...A194403...A194404
e..........1/2....A194405...A194406.............A194407
Pi.........1/2....A194408...A194409.............A194410
sqrt(2)....1/3....A194411...A194412...A194413...A194414
sqrt(3)....1/3....A194415...A194416...A194417...A194418
sqrt(5)....1/3....A194419...A194420.............A194421
sqrt(2)....2/3....A194422...A194423...A194424...A194425
tau...../2...A194461.......................A194462
tau........A194463.......................A194464
sqrt(2)....1/r.......A194465....................A194466
sqrt(3)....1/r.......A194467....................A194468
.
Next, suppose that r and c are chosen so that s(m)=0 for all m. Then the sets X={m : s(m)<0} and Y={m : s(m)>0} represent a pair of "generalized Beatty sequences" in this sense: if c=1/, the sets X and Y represent the Beatty sequences of 1/ and 1<-r>. Examples:
...
r..........c.........X.........Y......
sqrt(2)....r-1.......A003151...A003152
sqrt(3)....r-1.......A003511...A003512
tau........r-1.......A000201...A001950
sqrt(1/2)..r.........A001951...A001952
e..........e-2.......A000062...A098005

Ivan Niven, Diophantine Approximations, Interscience Publishers, 1963.

Henk Bruin and Robbert Fokkink, On the records and zeros of a deterministic random walk, arXiv:2503.11734 [math.DS], 2025. See p. 8.
Ronald L. Graham, Shen Lin, and Chio-Shih Lin, Spectra of numbers, Math. Mag. 51 (1978), 174-176.

Cf. A184369=(1/2)*A184368, A194285, A194469, A194470.

r = Sqrt[2]; c = 1/2;
x[n_] := Sum[FractionalPart[k*r], {k, 1, n}]
y[n_] := Sum[FractionalPart[c + k*r], {k, 1, n}]
t1 = Table[If[y[n] < x[n], 1, 0], {n, 1, 100}];
Flatten[Position[t1, 1]] (* empty *)
t2 = Table[If[y[n] == x[n], 1, 0], {n, 1, 800}];
Flatten[Position[t2, 1]] (* A194368 *)
%/2 (* A194369 *)
t3 = Table[If[y[n] > x[n], 1, 0], {n, 1, 100}];
Flatten[Position[t3, 1]] (* A194370 *)

A194388 Numbers m such that Sum_{k=1..m} (<1/2 + k*r> - ) = 0, where r=sqrt(11) and < > denotes fractional part.

Original entry on oeis.org

2, 4, 14, 16, 18, 22, 24, 26, 30, 32, 34, 44, 46, 48, 52, 54, 56, 60, 62, 64, 74, 76, 78, 82, 84, 86, 90, 92, 94, 104, 106, 108, 112, 114, 116, 120, 122, 124, 134, 136, 138, 142, 144, 146, 150, 152, 154, 164, 166, 168, 172, 174, 176, 180, 182, 184, 194, 196

Offset: 1

Clark Kimberling, Aug 23 2011

nonn

Every term is even; see A194368.

Cf. A010468, A194368, A194387, A194389.

r = Sqrt[11]; c = 1/2;
x[n_] := Sum[FractionalPart[k*r], {k, 1, n}]
y[n_] := Sum[FractionalPart[c + k*r], {k, 1, n}]
t1 = Table[If[y[n] < x[n], 1, 0], {n, 1, 200}];
Flatten[Position[t1, 1]]     (* A194387 *)
t2 = Table[If[y[n] == x[n], 1, 0], {n, 1, 200}];
Flatten[Position[t2, 1]]     (* A194388 *)
t3 = Table[If[y[n] > x[n], 1, 0], {n, 1, 200}];
Flatten[Position[t3, 1]]     (* A194389 *)

A194389 Numbers m such that Sum_{k=1..m} (<1/2 + k*r> - ) > 0, where r=sqrt(11) and < > denotes fractional part.

Original entry on oeis.org

1, 17, 19, 20, 21, 23, 33, 35, 36, 37, 38, 39, 40, 41, 42, 43, 45, 55, 57, 58, 59, 61, 77, 79, 80, 81, 83, 93, 95, 96, 97, 98, 99, 100, 101, 102, 103, 105, 115, 117, 118, 119, 121, 137, 139, 140, 141, 143, 153, 155, 156, 157, 158, 159, 160, 161, 162, 163

Offset: 1

Clark Kimberling, Aug 23 2011

nonn

See A194368.

Cf. A010468, A194368, A194387, A194388.

r = Sqrt[11]; c = 1/2;
x[n_] := Sum[FractionalPart[k*r], {k, 1, n}]
y[n_] := Sum[FractionalPart[c + k*r], {k, 1, n}]
t1 = Table[If[y[n] < x[n], 1, 0], {n, 1, 200}];
Flatten[Position[t1, 1]]     (* A194387 *)
t2 = Table[If[y[n] == x[n], 1, 0], {n, 1, 200}];
Flatten[Position[t2, 1]]     (* A194388 *)
t3 = Table[If[y[n] > x[n], 1, 0], {n, 1, 200}];
Flatten[Position[t3, 1]]     (* A194389 *)

cp's OEIS Frontend

A194368 Numbers m such that Sum_{k=1..m} (<1/2 + k*r> - ) = 0, where r=sqrt(2) and < > denotes fractional part.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

A194388 Numbers m such that Sum_{k=1..m} (<1/2 + k*r> - ) = 0, where r=sqrt(11) and < > denotes fractional part.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

A194389 Numbers m such that Sum_{k=1..m} (<1/2 + k*r> - ) > 0, where r=sqrt(11) and < > denotes fractional part.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica