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.

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

Table of values

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

List of values

[1, 1, 2, 2, 8, 4, 8, 4, 8, 8, 6, 6, 10, 8, 5, 4, 8, 8, 10, 8, 12, 6, 11, 6, 10, 10, 11, 7, 9, 7, 7, 4, 8, 8, 10, 8, 16, 12, 15, 10, 12, 12, 9, 9, 13, 11, 10, 6, 10, 10, 13, 11, 15, 11, 11, 7, 9, 9, 10, 7, 11, 7, 7, 4, 8, 8, 10, 8, 16, 12, 15, 10, 16, 16, 15, 13]