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.

A377838 Let p = prime(n), then a(n) is the least prime q < p such that p * q# + 1 is prime.

Table of values

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

List of values

[2, 2, 3, 2, 3, 3, 5, 2, 2, 13, 3, 2, 5, 3, 2, 7, 3, 5, 5, 3, 5, 2, 2, 11, 3, 3, 3, 5, 2, 13, 2, 3, 7, 13, 3, 7, 7, 5, 2, 2, 3, 2, 5, 13, 11, 29, 5, 19, 5, 2, 2, 3, 2, 3, 3, 13, 3, 3, 2, 3, 2, 13, 3, 3, 5, 3, 5, 3, 7, 7, 2, 3, 3, 11, 5, 67, 3, 7, 17, 2, 7, 2, 7]

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

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