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.

A261470 a(n) = prime(n+3) - prime(n+2) - prime(n+1) + prime(n).

Table of values

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

List of values

[1, 2, 0, 0, 0, 0, 4, -2, 0, 2, -4, 0, 4, 2, -4, 0, 2, -4, 2, 2, 0, 4, -2, -6, 0, 0, 0, 12, 0, -8, -2, 4, 0, -4, 4, -2, 0, 2, -4, 4, 0, -6, 0, 8, 10, -8, -10, 0, 4, -2, 4, 4, -4, 0, -4, 0, 2, -4, 6, 12, -6, -12, 0, 12, 2, -4, -4, -6, 4, 4, 0, -2, -2, 0, 4, -2, 0]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.