This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A258201 #14 Mar 01 2025 22:49:24 %S A258201 0,1,-3,-3,1,-4,-3,0,-7,-3,0,-226,-3,0,0,-3,0,-3,-3,0,-3,-3,0,1,-3,-3, %T A258201 1,-4,-3,0,-7,-3,0,-76,-3,0,0,-3,0,-3,-3,0,-3,-3,0,1,-3,-3,1,-4,-3,0, %U A258201 -7,-3,0,-46,-3,0,-7,-3,0,-3,-3,0,-3,-3,0,1,-3,-3,1,-4,-3,0,-6,-3,0,-33,-3,0 %N A258201 a(n) = smallest number encountered when iterating the map x -> floor(tan(x)) starting from the initial value x = n. %C A258201 Note that this sequence lists such values only for nonnegative integers, although the function is defined in all Z. %H A258201 Antti Karttunen, <a href="/A258201/b258201.txt">Table of n, a(n) for n = 0..10000</a> %F A258201 If n is equal to floor(tan(n)) then a(n) = n, otherwise (for any other n whether positive or negative) a(n) = min(n, a(floor(tan(n)))). [Recurrence defined in whole Z.] %o A258201 (MIT/GNU Scheme) (define (A258201 n) (let loop ((n n) (m n)) (let ((next (floor->exact (tan n)))) (if (= n next) m (loop next (min m next)))))) %Y A258201 Cf. A000503, A258020, A258021, A258022, A258024, A258202. %K A258201 sign %O A258201 0,3 %A A258201 _Antti Karttunen_, May 26 2015