A258203 -id:A258203 - cp's OEIS frontend

A258007 First differences of A258203.

3, 19, 3, 19, 3, 19, 3, 19, 3, 13, 6, 3, 13, 6, 3, 13, 6, 3, 13, 6, 3, 3, 10, 6, 3, 3, 10, 6, 3, 3, 16, 3, 3, 16, 3, 3, 19, 3, 7, 12, 3, 19, 3, 7, 12, 3, 19, 3, 19, 3, 19, 3, 19, 3, 13, 6, 3, 13, 6, 3, 13, 6, 3, 13, 6, 3, 3, 10, 6, 3, 3, 10, 6, 3, 3, 16, 3, 3, 16, 3, 3, 19, 3, 7, 12, 3, 19, 3, 19, 3, 19, 3, 19, 3, 19, 3, 19, 3, 13, 6

Offset: 1

Antti Karttunen after V.J. Pohjola's amazing A258200, Jun 05 2015

nonn

Antti Karttunen, Table of n, a(n) for n = 1..10000

Differs from A258200 for the first time at n=13.

Cf. A258006, A258203.

(define (A258007 n) (- (A258203 (+ 1 n)) (A258203 n)))

a(n) = A258203(n+1) - A258203(n).

A258024 Natural numbers n such that the iteration of the function floor(tan(k)) applied to n eventually reaches [the fixed point] 1 (or any larger integer if such fixed points exist), where k is interpreted as k radians.

Original entry on oeis.org

1, 4, 23, 26, 45, 48, 67, 70, 89, 92, 105, 111, 114, 121, 127, 133, 136, 143, 149, 155, 158, 171, 177, 180, 183, 193, 199, 202, 205, 215, 221, 224, 227, 243, 246, 249, 265, 268, 271, 290, 293, 300, 312, 315, 334, 337, 344, 356, 359, 378, 381, 400, 403, 422, 425, 444, 447, 460, 466, 469, 476, 482, 488, 491, 498, 504, 510, 513, 526, 532, 535, 538, 548, 554, 557, 560, 570, 576, 579, 582, 598, 601, 604, 620, 623, 626, 645, 648, 655, 667, 670

Offset: 1

V.J. Pohjola, May 16 2015

nonn

It is stated in the Comments in A000503 that in Floor(tan(n)) "Every integer appears infinitely often. - Charles R Greathouse IV, Aug 06 2012".
It is conjectured that applying the function floor(tan) k times, with k sufficiently large, on the finite sequence floor(tan(n)), n=0...N, the result is a sequence (cf. A258021) composed only of 0’s and 1’s for all values of N.
The original definition was: "Numbers n with property that floor(tan(n)) reduces to 1 (instead of 0) when the function is applied repeatedly to n with deep enough nesting level." If the conjecture above is true, then the new, in theory more inclusive definition produces exactly the same sequence. It has been checked that for at least up to A249836(13) = 1108341089274117551 there are no other strictly positive fixed points beside 1. - Antti Karttunen, May 26 2015
According to Jan Kristian Haugland (cf. link): It is an open problem whether (tan n) > n for infinitely many n, although it has been proved that |tan n| > n for infinitely many n. - Daniel Forgues, May 27 2015

			For n=0: 0. (0: 0 iteration)
For n=1: 1. (1: 0 iteration) (in this sequence)
For n=2: 2, -3, 0. (0: 2 iterations)
For n=3: 3, -1, -2, 2, -3, 0. (0: 5 iterations)
For n=4: 4, 1. (1: 1 iteration) (in this sequence)
For n=105: 105, 4, 1. (1: 2 iterations) (in this sequence)
For n=3561: 3561, -212, -18, 1. (1: 3 iterations) (in this sequence)
J. K. Haugland found n=37362253 s.t. tan(n) > n. (Cf. link.)
  For n=37362253: 37362253, 37754853, -1, -2, 2, -3, 0. (0: 6 iterations)
Bob Delaney found n=3083975227 s.t. tan(n) > n. (Cf. Robert Israel link.)
  For n=3083975227: 3083975227, 13356993783, -1, -2, 2, -3, 0.
For n s.t. tan(n) > n, see A249836. - _Daniel Forgues_, May 27 2015

Antti Karttunen, Table of n, a(n) for n = 1..10000
Jan Kristian Haugland, Re: analysis with tan n > n
Robert Israel, Re: tan n > n

Disjoint union of A258202 and A258203.
Cf. A258200 (first differences produce an interesting rhythm).
Cf. A258022 (complement provided that function x -> floor(tan(x)) does not form cycles larger than one).
Cf. A000503, A258020, A258021, A249836.

x = Table[Floor[Tan[n]], {n, 0, 10^4}];
y = NestWhile[Floor[Tan[#]] &, x, UnsameQ, 2];
Flatten[Position[y, 1]] - 1

Based on rewording by Daniel Forgues changed the formal definition to include also any hypothetical fixed points larger than one - Antti Karttunen, May 26 2015

A258202 Natural numbers n that have the property that starting from k = n, the fixed point of the map k -> floor(tan(k)) is strictly positive, while the smallest number encountered during the iteration is strictly negative.

Original entry on oeis.org

121, 143, 476, 498, 831, 853, 1076, 1186, 1208, 1541, 1563, 1786, 1896, 1918, 2251, 2273, 2606, 2628, 2961, 2983, 3316, 3338, 3561, 3671, 3693, 4026, 4048, 4381, 4403, 4736, 4758, 5091, 5113, 5336, 5446, 5468, 5801, 5823, 6156, 6178, 6511, 6533, 6866, 6888, 7221, 7243, 7576, 7598, 7821, 7931, 7953, 8286, 8308, 8641, 8663, 8996, 9018

Offset: 1

Antti Karttunen, May 26 2015

nonn

Numbers n for which A258021(n) > 0 and A258201(n) < 0.

Antti Karttunen, Table of n, a(n) for n = 1..10000

Complement of A258203 in A258024.

Cf. A258021, A258201.

cp's OEIS Frontend

A258007 First differences of A258203.

Views

Author

Keywords

Links

Crossrefs

Programs

Scheme

Formula

A258024 Natural numbers n such that the iteration of the function floor(tan(k)) applied to n eventually reaches [the fixed point] 1 (or any larger integer if such fixed points exist), where k is interpreted as k radians.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A258202 Natural numbers n that have the property that starting from k = n, the fixed point of the map k -> floor(tan(k)) is strictly positive, while the smallest number encountered during the iteration is strictly negative.

Views

Author

Keywords

Comments

Links

Crossrefs