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.

A336916 One more than the number of iterations of x -> 2x needed before the result is nondeficient, when starting from x=n; a(n) = 0, when n is a power of 2.

Table of values

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

List of values

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