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.

A336361 Number of iterations of A000593 (sum of divisors of odd part of n) needed to reach a power of 2, or -1 if never reached.

Table of values

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

List of values

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