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.

A059571 From Mertens's conjecture (1): floor(sqrt(n)) - |M(n)|, where M is Mertens's function A002321.

Table of values

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

List of values

[0, 1, 0, 1, 0, 1, 0, 0, 1, 2, 1, 1, 0, 1, 2, 3, 2, 2, 1, 1, 2, 3, 2, 2, 3, 4, 4, 4, 3, 2, 1, 1, 2, 3, 4, 5, 4, 5, 6, 6, 5, 4, 3, 3, 3, 4, 3, 3, 4, 4, 5, 5, 4, 4, 5, 5, 6, 7, 6, 6, 5, 6, 6, 7, 8, 7, 6, 6, 7, 6, 5, 5, 4, 5, 5, 5, 6, 5, 4, 4, 5, 6, 5, 5, 6, 7, 8, 8, 7, 7, 8, 8, 9]