This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 Antti Karttunen, Table of n, a(n) for n = 0..10000 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. A000503, A258020, A258202, A249836. Cf. also A258022 (positions of terms <= 0), A258024 (positions of terms >= 1), A258201 (the smallest number visited in the iteration). Sequence in context: A091444 A091447 A106701 * A033684 A080885 A258998 Adjacent sequences:  A258018 A258019 A258020 * A258022 A258023 A258024 KEYWORD nonn AUTHOR V.J. Pohjola & Antti Karttunen, May 24 2015 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 22 04:25 EDT 2019. Contains 328315 sequences. (Running on oeis4.)