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.

A385393 a(n) = (Sum_{k=0..n} (binomial(n, k) mod 4)) / 2^bitcount(n).

Table of values

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

List of values

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