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.

A182850 a(n) = number of iterations that n requires to reach a fixed point under the x -> A181819(x) map.

Table of values

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

List of values

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