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.

A281875 Least k such that phi(k) is the sum of two primes in exactly n ways, or 0 if no such k exists.

Table of values

n a(n)
0 1
1 5
2 11
3 23
4 37
5 65
6 61
7 79
8 103
9 161
10 127
11 157
12 143
13 199
14 181
15 307
16 277
17 313
18 241
19 211
20 409
21 341
22 379
23 487
24 331
25 623
26 577
27 551
28 463
29 527
30 421
31 571
32 601
33 673
34 829
35 757
36 877
37 997
38 1571
39 691
40 1039
41 631
42 1009
43 961
44 869
45 967
46 1543
47 989
48 1057
49 1247
50 2411
51 899
52 991
53 1303
54 1147
55 1231
56 1999

List of values

[1, 5, 11, 23, 37, 65, 61, 79, 103, 161, 127, 157, 143, 199, 181, 307, 277, 313, 241, 211, 409, 341, 379, 487, 331, 623, 577, 551, 463, 527, 421, 571, 601, 673, 829, 757, 877, 997, 1571, 691, 1039, 631, 1009, 961, 869, 967, 1543, 989, 1057, 1247, 2411, 899, 991, 1303, 1147, 1231, 1999]