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.

A361744 A(n,k) is the least m such that there are k primes in the set {prime(n) + 2^i | 1 <= i <= m}, or -1 if no such number exists; square array A(n,k), n > 1, k >= 1, read by antidiagonals.

Table of values

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

List of values

[1, 2, 1, 3, 3, 2, 4, 5, 4, 1, 6, 11, 6, 3, 2, 7, 47, 8, 5, 4, 1, 12, 53, 10, 7, 8, 13, 2, 15, 141, 16, 9, 20, 21, 6, 3, 16, 143, 18, 15, 38, 33, 30, 7, 1, 18, 191, 20, 23, 64, 81, 162, 39, 3, 4, 28, 273, 28, 29, 80, 129, 654, 79, 5, 12, 2]