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.

A320146 a(n) = 2*prime(n) modulo (prime(n-1) + prime(n+1)).

Table of values

n a(n)
2 6
3 0
4 14
5 2
6 26
7 2
8 38
9 46
10 4
11 62
12 2
13 2
14 86
15 94
16 0
17 4
18 122
19 2
20 2
21 146
22 2
23 166
24 178
25 4
26 2
27 206
28 2
29 218
30 226
31 10
32 262
33 4
34 278
35 8
36 302
37 0
38 2
39 334
40 0
41 4
42 362
43 8
44 386
45 2
46 398
47 0
48 8
49 2
50 458
51 466
52 4
53 482
54 4
55 0
56 0
57 4
58 542
59 2
60 2
61 566
62 586
63 10
64 2
65 626
66 634
67 8
68 674
69 8
70 698
71 706
72 718
73 2
74 0
75 2
76 766
77 778
78 4
79 802
80 818
81 8
82 842

List of values

[6, 0, 14, 2, 26, 2, 38, 46, 4, 62, 2, 2, 86, 94, 0, 4, 122, 2, 2, 146, 2, 166, 178, 4, 2, 206, 2, 218, 226, 10, 262, 4, 278, 8, 302, 0, 2, 334, 0, 4, 362, 8, 386, 2, 398, 0, 8, 2, 458, 466, 4, 482, 4, 0, 0, 4, 542, 2, 2, 566, 586, 10, 2, 626, 634, 8, 674, 8, 698, 706, 718, 2, 0, 2, 766, 778, 4, 802, 818, 8, 842]