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.

A277808 a(n) = number of iterations of map k -> A003188(A006068(k)/2) that are required (when starting from k = n) until k is an odious number.

Table of values

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

List of values

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