cp's OEIS Frontend

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.

A258020 Number of steps to reach a fixed point with map x -> floor(tan(x)) when starting the iteration with the initial value x = n.

Table of values

n a(n)
0 0
1 0
2 2
3 5
4 1
5 5
6 5
7 1
8 6
9 5
10 1
11 2
12 5
13 1
14 2
15 5
16 1
17 6
18 4
19 1
20 3
21 4
22 1
23 1
24 2
25 5
26 1
27 5
28 5
29 1
30 6
31 5
32 1
33 6
34 5
35 1
36 2
37 5
38 1
39 6
40 4
41 1
42 3
43 4
44 1
45 1
46 2
47 5
48 1
49 5
50 5
51 1
52 6
53 5
54 1
55 4
56 5
57 1
58 7
59 5
60 1
61 6
62 4
63 1
64 3
65 4
66 1
67 1
68 2
69 5
70 1
71 5
72 5
73 1
74 2
75 5
76 1
77 7
78 5
79 1
80 6
81 5
82 1
83 6
84 4
85 1
86 3
87 4
88 1
89 1
90 4
91 5
92 1
93 2
94 5
95 1
96 2
97 5
98 1
99 5
100 5
101 1
102 6
103 5
104 1
105 2
106 4
107 1
108 3
109 4
110 1
111 1
112 4
113 5
114 1
115 2
116 5
117 1
118 2
119 5
120 1

List of values

[0, 0, 2, 5, 1, 5, 5, 1, 6, 5, 1, 2, 5, 1, 2, 5, 1, 6, 4, 1, 3, 4, 1, 1, 2, 5, 1, 5, 5, 1, 6, 5, 1, 6, 5, 1, 2, 5, 1, 6, 4, 1, 3, 4, 1, 1, 2, 5, 1, 5, 5, 1, 6, 5, 1, 4, 5, 1, 7, 5, 1, 6, 4, 1, 3, 4, 1, 1, 2, 5, 1, 5, 5, 1, 2, 5, 1, 7, 5, 1, 6, 5, 1, 6, 4, 1, 3, 4, 1, 1, 4, 5, 1, 2, 5, 1, 2, 5, 1, 5, 5, 1, 6, 5, 1, 2, 4, 1, 3, 4, 1, 1, 4, 5, 1, 2, 5, 1, 2, 5, 1]