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.

A257081 a(n) = Number of iterations of A257080 needed, starting from n, before a fixed point is reached.

Table of values

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

List of values

[0, 2, 1, 2, 0, 3, 1, 3, 1, 1, 2, 2, 0, 4, 2, 2, 0, 3, 0, 2, 3, 2, 0, 3, 1, 3, 1, 3, 1, 2, 1, 4, 1, 1, 7, 3, 1, 6, 1, 3, 2, 5, 1, 4, 1, 1, 2, 3, 0, 4, 2, 2, 0, 4, 2, 2, 9, 10, 4, 8, 0, 6, 3, 3, 0, 6, 0, 3, 6, 3, 0, 6, 0, 2, 2, 2, 0, 3, 2, 2, 2, 2, 1, 3, 0, 1, 3, 1, 0, 2, 0, 2, 2, 3, 0, 4, 0, 3, 8, 4, 0, 5, 6, 5, 3, 2, 6, 4, 0, 3, 1, 5, 0, 5, 0, 2, 2, 2, 0, 6, 1]