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.

A195017 If n = Product_{k >= 1} (p_k)^(c_k) where p_k is k-th prime and c_k >= 0 then a(n) = Sum_{k >= 1} c_k*((-1)^(k-1)).

Table of values

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

List of values

[0, 1, -1, 2, 1, 0, -1, 3, -2, 2, 1, 1, -1, 0, 0, 4, 1, -1, -1, 3, -2, 2, 1, 2, 2, 0, -3, 1, -1, 1, 1, 5, 0, 2, 0, 0, -1, 0, -2, 4, 1, -1, -1, 3, -1, 2, 1, 3, -2, 3, 0, 1, -1, -2, 2, 2, -2, 0, 1, 2, -1, 2, -3, 6, 0, 1, 1, 3, 0, 1, -1, 1, 1, 0, 1, 1, 0, -1, -1, 5, -4, 2, 1, 0, 2, 0, -2, 4, -1, 0, -2, 3, 0, 2, 0, 4, 1, -1, -1, 4, -1, 1, 1, 2, -1]