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.

A356741 a(n) is the least prime(m) such that prime(n) + prime(m)# is prime, where prime(m)# denotes the product of the first m primes, or -1 if no such prime(m) exists.

Table of values

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

List of values

[2, 2, 3, 2, 3, 2, 7, 3, 2, 3, 3, 2, 5, 3, 3, 2, 3, 3, 2, 3, 5, 3, 11, 3, 2, 3, 2, 5, 11, 5, 3, 2, 7, 2, 3, 3, 5, 3, 3, 2, 5, 2, 3, 2, 5, 5, 3, 2, 7, 3, 2, 5, 3, 3, 3, 2, 3, 3, 2, 5, 7, 3, 2, 7, 5, 3, 5, 2, 5, 3, 5, 3, 3, 5, 3, 5, 7, 5, 5, 2, 7, 2, 3, 11, 3, 5, 3]