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.

A182321 Number of iterations of A025581(n) required to reach 0.

Table of values

n a(n)
0 0
1 1
2 2
3 1
4 3
5 2
6 1
7 2
8 3
9 2
10 1
11 4
12 2
13 3
14 2
15 1
16 3
17 4
18 2
19 3
20 2
21 1
22 2
23 3
24 4
25 2
26 3
27 2
28 1
29 3
30 2
31 3
32 4
33 2
34 3
35 2
36 1
37 4
38 3
39 2
40 3
41 4
42 2
43 3
44 2
45 1
46 3
47 4
48 3
49 2
50 3
51 4
52 2
53 3
54 2
55 1
56 2
57 3
58 4
59 3
60 2
61 3
62 4
63 2
64 3
65 2
66 1

List of values

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