A262965 - cp's OEIS frontend

A262965 Least number k such that k mod s = prime(n) where s is the sum of the distinct primes dividing k.

n	a(n)
1	12
2	10
3	14
4	15
5	26
6	57
7	38
8	85
9	87
10	62
11	111
12	129
13	86
14	603
15	159
16	177
17	122
18	201
19	219
20	146
21	237
22	927
23	267
24	545
25	309
26	206
27	327
28	218
29	1057
30	1016
31	1359
32	411
33	278
34	1267
35	302
36	471
37	489
38	3088
39	519
40	537
41	362
42	1561
43	386
44	597
45	398
46	1687
47	3856
48	687
49	458
50	1897
51	717
52	482

[12, 10, 14, 15, 26, 57, 38, 85, 87, 62, 111, 129, 86, 603, 159, 177, 122, 201, 219, 146, 237, 927, 267, 545, 309, 206, 327, 218, 1057, 1016, 1359, 411, 278, 1267, 302, 471, 489, 3088, 519, 537, 362, 1561, 386, 597, 398, 1687, 3856, 687, 458, 1897, 717, 482]

cp's OEIS Frontend

A262965 Least number k such that k mod s = prime(n) where s is the sum of the distinct primes dividing k.

Table of values

List of values