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.

A151893 a(n) = smallest number k such that n! + k-th prime after n! is prime.

Table of values

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

List of values

[1, 1, 1, 1, 2, 1, 1, 2, 4, 10, 2, 4, 3, 1, 1, 4, 2, 9, 14, 1, 6, 14, 6, 5, 1, 11, 3, 35, 14, 20, 4, 1, 10, 1, 1, 6, 37, 33, 25, 17, 62, 2, 5, 26, 12, 10, 11, 37, 9, 9, 4, 50, 32, 9, 9, 7, 9, 47, 10, 40, 80, 60, 3, 18, 6, 2, 1]