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.

A262905 a(n) = number of steps needed to reach zero when starting with k = n, and repeatedly replacing k with A262904(k).

Table of values

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

List of values

[0, 1, 2, 1, 1, 1, 3, 1, 1, 3, 3, 3, 2, 3, 3, 3, 3, 3, 2, 3, 3, 3, 2, 3, 3, 2, 2, 3, 2, 3, 4, 3, 2, 3, 2, 3, 3, 3, 2, 3, 2, 3, 2, 3, 2, 3, 4, 3, 2, 4, 2, 3, 4, 3, 4, 3, 2, 3, 4, 3, 2, 3, 3, 3, 3, 3, 4, 3, 3, 3, 4, 3, 2, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 4, 4, 4, 4, 4, 4, 4, 2, 4, 3, 4, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 4]