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.

A178771 a(0)=0, a(1)=1, a(2)=1, a(3)=1, thereafter a(n) = If[Mod[ n, 2] == 0, a(Floor[n/2]), a(a(Floor[(n - 1)/2])) + a(n - a(Floor[( n - 3)/2]))].

Table of values

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

List of values

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