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.

A322984 Number of iterations of A011371(x) = x - A000120(x) needed to reach an odd number, when starting from x = 2n.

Table of values

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

List of values

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