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.

A063473 a(n) = M(2*n-1), where M(n) is Mertens's function (A002321): Sum_{k=1..n} mu(k), where mu = Moebius function (A008683).

Table of values

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

List of values

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