A272175 - cp's OEIS frontend

A272175 Least number k such that (k^2+1) mod s = prime(n) where s is the sum of the distinct primes dividing k^2+1, or 0 if no such k exists.

n	a(n)
1	13
2	3
3	68
4	182
5	5
6	32
7	191
8	333
9	73
10	70
11	1068
12	132
13	507
14	173
15	774
16	50
17	11
18	30
19	1553
20	3990
21	338
22	2307
23	246
24	2917
25	1228
26	80
27	14369
28	76
29	114
30	1590
31	2529
32	100
33	28
34	4952
35	82
36	659
37	948
38	7083
39	2190
40	8938
41	19
42	489
43	11393
44	1968
45	2941
46	21124
47	3549
48	1725
49	64
50	1382
51	2540

[13, 3, 68, 182, 5, 32, 191, 333, 73, 70, 1068, 132, 507, 173, 774, 50, 11, 30, 1553, 3990, 338, 2307, 246, 2917, 1228, 80, 14369, 76, 114, 1590, 2529, 100, 28, 4952, 82, 659, 948, 7083, 2190, 8938, 19, 489, 11393, 1968, 2941, 21124, 3549, 1725, 64, 1382, 2540]

cp's OEIS Frontend

A272175 Least number k such that (k^2+1) mod s = prime(n) where s is the sum of the distinct primes dividing k^2+1, or 0 if no such k exists.

Table of values

List of values