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.

A090189 Least k such that k*p(n)#-p(n+1) is prime, where p(i)# denotes the i-th primorial and p(i) denotes the i-th prime.

Table of values

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

List of values

[3, 2, 1, 1, 1, 1, 2, 1, 3, 5, 2, 4, 6, 3, 5, 7, 26, 5, 7, 11, 10, 1, 1, 1, 11, 5, 3, 8, 3, 20, 14, 4, 2, 39, 1, 16, 4, 6, 3, 56, 8, 7, 17, 14, 4, 21, 7, 13, 13, 22, 30, 10, 22, 6, 2, 43, 3, 17, 26, 21, 32, 10, 28, 30, 15, 28, 22, 74, 23, 33, 11, 8, 1, 4, 3, 5, 2, 29, 3, 68, 36, 14, 1, 133, 4]