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.

A379014 Least number k such that prime(n) + prime(k) is a multiple of n, or -1 if no such number exists.

Table of values

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

List of values

[1, 2, 4, 3, 8, 3, 5, 3, 6, 5, 1, 5, 5, 6, 6, 5, 14, 5, 15, 10, 5, 11, 26, 4, 2, 2, 3, 3, 4, 4, 17, 10, 18, 11, 18, 10, 34, 27, 19, 19, 19, 10, 19, 20, 21, 11, 20, 7, 19, 20, 21, 21, 111, 8, 21, 7, 21, 8, 65, 8, 23, 7, 20, 21, 68, 6, 20, 2, 19, 20, 1, 21, 20, 20]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.