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.

A096303 Number of iterations of n -> n + (number of 1's in binary representation of n) needed for the trajectory of n to join the trajectory of A010062.

Table of values

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

List of values

[0, 0, 0, 1, 0, 4, 0, 3, 2, 0, 1, 0, 2, 0, 1, 1, 0, 2, 0, 1, 6, 0, 2, 5, 0, 4, 1, 0, 3, 2, 0, 3, 2, 1, 1, 0, 5, 0, 2, 4, 0, 3, 1, 0, 2, 7, 0, 7, 1, 6, 1, 0, 5, 3, 0, 2, 4, 2, 1, 0, 3, 1, 6, 0, 0, 2, 0, 1, 5, 0, 2, 4, 0, 3, 1, 0, 2, 5, 0, 5, 1, 4, 1, 0, 3, 10, 0, 2, 2, 9, 1, 0, 1, 8, 1, 0, 8, 0, 7, 7, 0, 6, 6, 6, 0]