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.

A271384 Least k with precisely n partitions k = x + y satisfying phi(k) = phi(x) + phi(y), where phi(k) is the Euler totient function of k.

Table of values

n a(n)
1 3
2 14
3 20
4 28
5 44
6 92
7 112
8 224
9 266
10 260
11 404
12 380
13 476
14 552
15 558
16 696
17 860
18 984
19 846
20 1062
21 1388
22 1128
23 1278
24 1752
25 1494
26 1422
27 2034
28 1926
29 1704
30 1992
31 2358
32 2466
33 2712
34 2424
35 2718
36 3222
37 3006
38 3258
39 4924
40 3288
41 3582
42 4296
43 3798
44 4008
45 4518
46 5688
47 5094
48 5352

List of values

[3, 14, 20, 28, 44, 92, 112, 224, 266, 260, 404, 380, 476, 552, 558, 696, 860, 984, 846, 1062, 1388, 1128, 1278, 1752, 1494, 1422, 2034, 1926, 1704, 1992, 2358, 2466, 2712, 2424, 2718, 3222, 3006, 3258, 4924, 3288, 3582, 4296, 3798, 4008, 4518, 5688, 5094, 5352]