cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A336297 Prime numbers p such that equation x = p*sopf(x) (where sopf(x) is the sum of distinct prime factors of x) has exactly 1 solution in positive integers.

Table of values

n a(n)
1 2
2 61
3 97
4 113
5 151
6 173
7 241
8 277
9 317
10 353
11 389
12 449
13 457
14 593
15 601
16 607
17 653
18 673
19 683
20 727
21 733
22 797
23 907
24 929
25 941
26 947
27 953
28 977
29 997
30 1021
31 1051
32 1087
33 1153
34 1181
35 1193
36 1217
37 1249
38 1307
39 1321
40 1361
41 1373
42 1409
43 1433
44 1489
45 1493
46 1523
47 1553
48 1579
49 1597
50 1609
51 1627

List of values

[2, 61, 97, 113, 151, 173, 241, 277, 317, 353, 389, 449, 457, 593, 601, 607, 653, 673, 683, 727, 733, 797, 907, 929, 941, 947, 953, 977, 997, 1021, 1051, 1087, 1153, 1181, 1193, 1217, 1249, 1307, 1321, 1361, 1373, 1409, 1433, 1489, 1493, 1523, 1553, 1579, 1597, 1609, 1627]