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.

A321860 Number of primes congruent to 2, 6, 7, 8, 10 modulo 11 and <= n minus number of primes congruent to 1, 3, 4, 5, 9 modulo 11 and <= n.

Table of values

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

List of values

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