A212710 - cp's OEIS frontend

A212710 Smallest number k such that the difference between the greatest prime divisor of k^2+1 and the sum of the other prime distinct divisors equals n.

n	a(n)
1	411
2	1
3	3
4	447
5	2
6	57
7	212
8	8
9	307
10	13
11	5
12	38
13	319
14	99
15	3310
16	70
17	4
18	242
19	132
20	50
21	73
22	17
23	192
24	12
25	133
26	3532
27	41
28	22231
29	999
30	43
31	172
32	68
33	83
34	11878
35	294
36	30
37	6
38	111
39	9
40	776
41	2059
42	922
43	818
44	46
45	1183
46	23
47	216
48	182
49	557
50	2010
51	1818
52	3323
53	945
54	512
55	568
56	76

[411, 1, 3, 447, 2, 57, 212, 8, 307, 13, 5, 38, 319, 99, 3310, 70, 4, 242, 132, 50, 73, 17, 192, 12, 133, 3532, 41, 22231, 999, 43, 172, 68, 83, 11878, 294, 30, 6, 111, 9, 776, 2059, 922, 818, 46, 1183, 23, 216, 182, 557, 2010, 1818, 3323, 945, 512, 568, 76]

cp's OEIS Frontend

A212710 Smallest number k such that the difference between the greatest prime divisor of k^2+1 and the sum of the other prime distinct divisors equals n.

Table of values

List of values