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.

A065081 Alternating bit sum (A065359) for n-th prime p: replace 2^k with (-1)^k in binary expansion of p.

Table of values

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

List of values

[-1, 0, 2, 1, -1, 1, 2, 1, 2, 2, 1, 1, -1, -2, -1, 2, -1, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, -1, 1, 2, 1, -1, -1, -2, 2, 1, 1, -2, -1, -1, -1, 1, -1, 1, 2, 1, 1, 1, -1, 1, -1, -1, 1, -1, 2, 2, 2, 1, 4, 2, 1, 2, 1, 2, 1, 2, 1, 4, 2, 4, 2, 2, 1, 4, 1, 2, 2, 1, 2, 1, -1, 1, -1, 1, 1, -1, 2, 1, 2, 1, 2, 2, 1, -1, 1, 2, 2, -1, -2, 1]