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.

A325562 Number of iterations of A234741 needed when started from n before a fixed point is reached.

Table of values

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

List of values

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