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.

A241425 Largest number k > 0 such that n + k! and n - k! are both prime, or 0 if no such k exists.

Table of values

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

List of values

[0, 0, 0, 1, 2, 1, 0, 0, 2, 0, 3, 1, 3, 0, 2, 0, 3, 1, 0, 0, 2, 0, 3, 0, 3, 0, 0, 0, 4, 1, 0, 0, 0, 0, 4, 0, 4, 0, 2, 0, 0, 1, 4, 0, 2, 0, 4, 0, 0, 0, 0, 0, 3, 0, 4, 0, 0, 0, 0, 1, 0, 0, 0, 0, 4, 0, 3, 0, 2, 0, 0, 1, 3, 0, 0, 0, 4, 0, 0, 0, 2, 0, 4, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3]