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.

A070965 a(1) = 1; a(n+1) = sum{k|n} a(k) * mu(k), where the sum is over the positive divisors, k, of n; and mu(k) is the Moebius function.

Table of values

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

List of values

[1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, -1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, -1, 2, -1, 2, 0, 0, 0, 0, 1, 0, -1, -1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 2, 0, 1, 1, 1, -1, -1, 0, 1, -1, 2, 3, 1, 0, 0, 1, 0, 0, 1, -1, 2, 1, 0, -1, 0, -1, -2, 2, -1, 1, 1, 0, 1, 1, 2, 1, 3, 0, 1, -1, -2, 0, 2, 2, 2, 1, 0, -1, 0, 1, 0, 2, -1, 0]