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.

A178677 If n mod 2 == 0, a(n) = a(floor(n/2)), otherwise a(n) = a(a(floor((n-1)/2))) + a(n - a(floor((n-1)/2))).

Table of values

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

List of values

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