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.

A096500 Let f(n) = smallest prime > n; a(n) = f(n+1) - f(n).

Table of values

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

List of values

[1, 2, 0, 2, 0, 4, 0, 0, 0, 2, 0, 4, 0, 0, 0, 2, 0, 4, 0, 0, 0, 6, 0, 0, 0, 0, 0, 2, 0, 6, 0, 0, 0, 0, 0, 4, 0, 0, 0, 2, 0, 4, 0, 0, 0, 6, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 2, 0, 6, 0, 0, 0, 0, 0, 4, 0, 0, 0, 2, 0, 6, 0, 0, 0, 0, 0, 4, 0, 0, 0, 6, 0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 2, 0, 4, 0, 0, 0]