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.

A110172 Conjectured numbers j such that phi(j) + phi(k) = phi(j+k) has no solution k, where phi is Euler's totient function.

Table of values

n a(n)
1 3
2 15
3 21
4 39
5 45
6 57
7 69
8 105
9 147
10 165
11 177
12 195
13 213
14 273
15 285
16 315
17 345
18 393
19 399
20 465
21 489
22 525
23 585
24 615
25 633
26 645
27 651
28 681
29 717
30 777
31 807
32 813
33 843
34 855
35 879
36 885
37 903
38 915
39 933
40 939
41 1005
42 1035
43 1041
44 1065
45 1095
46 1149
47 1263
48 1281
49 1293
50 1317
51 1395

List of values

[3, 15, 21, 39, 45, 57, 69, 105, 147, 165, 177, 195, 213, 273, 285, 315, 345, 393, 399, 465, 489, 525, 585, 615, 633, 645, 651, 681, 717, 777, 807, 813, 843, 855, 879, 885, 903, 915, 933, 939, 1005, 1035, 1041, 1065, 1095, 1149, 1263, 1281, 1293, 1317, 1395]