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.

A345366 a(n) = (p*q+1) mod (p+q) where p=prime(n) and q=prime(n+1).

Table of values

n a(n)
1 2
2 0
3 0
4 6
5 0
6 12
7 0
8 18
9 44
10 0
11 60
12 36
13 0
14 42
15 92
16 104
17 0
18 120
19 66
20 0
21 144
22 78
23 164
24 78
25 96
26 0
27 102
28 0
29 108
30 192
31 126
32 260
33 0
34 264
35 0
36 300
37 312
38 162
39 332
40 344
41 0
42 348
43 0
44 192
45 0
46 170
47 182
48 222
49 0
50 228
51 464
52 0
53 468
54 500
55 512
56 524
57 0
58 540
59 276
60 0
61 552
62 552
63 306

List of values

[2, 0, 0, 6, 0, 12, 0, 18, 44, 0, 60, 36, 0, 42, 92, 104, 0, 120, 66, 0, 144, 78, 164, 78, 96, 0, 102, 0, 108, 192, 126, 260, 0, 264, 0, 300, 312, 162, 332, 344, 0, 348, 0, 192, 0, 170, 182, 222, 0, 228, 464, 0, 468, 500, 512, 524, 0, 540, 276, 0, 552, 552, 306]