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.

A254863 Least prime p such that p + previousprime(p) is a multiple of n.

Table of values

n a(n)
1 3
2 5
3 7
4 5
5 3
6 7
7 23
8 5
9 11
10 17
11 101
12 7
13 29
14 23
15 17
16 59
17 37
18 11
19 79
20 31
21 23
22 101
23 71
24 13
25 53
26 29
27 83
28 43
29 349
30 17
31 97
32 67
33 101
34 37
35 107
36 19
37 113
38 79
39 41
40 61
41 211
42 23
43 89
44 157
45 47
46 71
47 283
48 73
49 443
50 53
51 103
52 29
53 641
54 83
55 167
56 59
57 229
58 349
59 239
60 31
61 613
62 97
63 317
64 67
65 197
66 101
67 137
68 37
69 71
70 107
71 431
72 73

List of values

[3, 5, 7, 5, 3, 7, 23, 5, 11, 17, 101, 7, 29, 23, 17, 59, 37, 11, 79, 31, 23, 101, 71, 13, 53, 29, 83, 43, 349, 17, 97, 67, 101, 37, 107, 19, 113, 79, 41, 61, 211, 23, 89, 157, 47, 71, 283, 73, 443, 53, 103, 29, 641, 83, 167, 59, 229, 349, 239, 31, 613, 97, 317, 67, 197, 101, 137, 37, 71, 107, 431, 73]