A337767 - cp's OEIS frontend

A337767 Array T(n,k) (n >= 1, k >= 1) read by upward antidiagonals and defined as follows. Let N(p,i) denote the result of applying "nextprime" i times to p; T(n,k) = smallest prime p such that N(p,n) - p = 2*k, or 0 if no such prime exists.

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

[3, 0, 7, 0, 3, 23, 0, 0, 5, 89, 0, 0, 0, 23, 139, 0, 0, 0, 3, 19, 199, 0, 0, 0, 0, 7, 47, 113, 0, 0, 0, 0, 3, 17, 83, 1831, 0, 0, 0, 0, 0, 5, 23, 211, 523, 0, 0, 0, 0, 0, 0, 17, 43, 109, 887, 0, 0, 0, 0, 0, 0, 3, 13, 79, 317, 1129, 0, 0, 0, 0, 0, 0, 0, 7, 19, 107, 619, 1669]

cp's OEIS Frontend

A337767 Array T(n,k) (n >= 1, k >= 1) read by upward antidiagonals and defined as follows. Let N(p,i) denote the result of applying "nextprime" i times to p; T(n,k) = smallest prime p such that N(p,n) - p = 2*k, or 0 if no such prime exists.

Table of values

List of values