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.

A362489 a(n) is the least number k such that the equation iphi(x) = k has exactly 2*n solutions, or -1 if no such k exists, where iphi is the infinitary totient function A091732.

Table of values

n a(n)
0 5
1 1
2 6
3 12
4 36
5 24
6 396
7 48
8 216
9 96
10 528
11 144
12 384
13 2784
14 432
15 240
16 1296
17 288
18 1584
19 1800
20 480
21 1680
22 1080
23 864
24 576
25 3240
26 2016
27 960
28 6624
29 720
30 1152
31 7776
32 12000
33 8448
34 5280
35 1728
36 10752
37 2304
38 4032
39 4800
40 6048
41 3840
42 2160
43 5184
44 4608
45 6336
46 1440
47 10560
48 29568

List of values

[5, 1, 6, 12, 36, 24, 396, 48, 216, 96, 528, 144, 384, 2784, 432, 240, 1296, 288, 1584, 1800, 480, 1680, 1080, 864, 576, 3240, 2016, 960, 6624, 720, 1152, 7776, 12000, 8448, 5280, 1728, 10752, 2304, 4032, 4800, 6048, 3840, 2160, 5184, 4608, 6336, 1440, 10560, 29568]