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.

A375010 a(n) = prime(n-1) - floor((prime(n-2) + prime(n-1) + prime(n)) / 3).

Table of values

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

List of values

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