A060392 - cp's OEIS frontend

A060392 Let f(m) = smallest prime that divides k^2 + k + m for k = 0,1,2,...; sequence gives smallest m >= 0 such that f(m) is the n-th prime.

n	a(n)
1	0
2	1
3	5
4	47
5	11
6	221
7	17
8	1217
9	941
10	2747
11	8081
12	9281
13	41
14	55661
15	19421
16	333491
17	1262201
18	601037
19	5237651
20	9063641
21	12899891
22	26149427
23	24073871
24	28537121
25	352031501
26	398878547
27	160834691
28	67374467
29	146452961
30	24169417397

[0, 1, 5, 47, 11, 221, 17, 1217, 941, 2747, 8081, 9281, 41, 55661, 19421, 333491, 1262201, 601037, 5237651, 9063641, 12899891, 26149427, 24073871, 28537121, 352031501, 398878547, 160834691, 67374467, 146452961, 24169417397]

cp's OEIS Frontend

A060392 Let f(m) = smallest prime that divides k^2 + k + m for k = 0,1,2,...; sequence gives smallest m >= 0 such that f(m) is the n-th prime.

Table of values

List of values