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.

A294639 a(n) = least prime p such that n divides p + prime(n).

Table of values

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

List of values

[2, 3, 7, 5, 19, 5, 11, 5, 13, 11, 2, 11, 11, 13, 13, 11, 43, 11, 47, 29, 11, 31, 101, 7, 3, 3, 5, 5, 7, 7, 59, 29, 61, 31, 61, 29, 139, 103, 67, 67, 67, 29, 67, 71, 73, 31, 71, 17, 67, 71, 73, 73, 607, 19, 73, 17, 73, 19, 313, 19, 83, 17, 71, 73, 337, 13, 71]