|
|
A258021
|
|
Eventual fixed point of map x -> floor(tan(x)) when starting the iteration with the initial value x = n.
|
|
7
|
|
|
0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0
|
|
COMMENTS
|
Note that this sequence lists the terminating values only for the nonnegative starting points of the iteration map, although the function is defined in all Z and the intermediate steps in iteration may visit also negative numbers.
Pohjola conjectures that no other numbers than 0 and 1 will ever occur in this sequence.
In any case, any strictly positive term present in this sequence must be one of the terms of A249836.
|
|
LINKS
|
|
|
FORMULA
|
If n is equal to floor(tan(n)), then a(n) = n, and for any other n (positive or negative), a(n) = a(floor(tan(n))). [Recurrence defined in whole Z.]
|
|
PROG
|
(Scheme) (define (A258021 n) (if (= n (floor->exact (tan n))) n (A258021 (floor->exact (tan n)))))
|
|
CROSSREFS
|
Cf. also A258022 (positions of terms <= 0), A258024 (positions of terms >= 1), A258201 (the smallest number visited in the iteration).
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|