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.

A076544 a(n) = mu(n) + sqf(n) where mu(n) is Moebius function, sqf(n) = 1 if n is squarefree and sqf(n) = -1 otherwise.

Table of values

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

List of values

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