A357917 - cp's OEIS frontend

A357917 a(n) is the least k such that phi(k) + d(k) = A357916(n), where phi(k) = A000010(k) is Euler's totient function, and d(k) = A000005(k) is the number of divisors of k.

n	a(n)
1	1
2	2
3	4
4	16
5	25
6	81
7	121
8	256
9	484
10	1296
11	529
12	1024
13	1600
14	2116
15	2401
16	7744
17	11664
18	5041
19	7225
20	11236
21	20164
22	10201
23	25600
24	12769
25	30976
26	46656
27	21025
28	17161
29	44944
30	51076
31	29929
32	84100
33	73984
34	36481
35	75076
36	107584
37	54289
38	63001
39	87025
40	69169
41	101761
42	126025
43	215296
44	256036
45	252004
46	295936

[1, 2, 4, 16, 25, 81, 121, 256, 484, 1296, 529, 1024, 1600, 2116, 2401, 7744, 11664, 5041, 7225, 11236, 20164, 10201, 25600, 12769, 30976, 46656, 21025, 17161, 44944, 51076, 29929, 84100, 73984, 36481, 75076, 107584, 54289, 63001, 87025, 69169, 101761, 126025, 215296, 256036, 252004, 295936]

cp's OEIS Frontend

A357917 a(n) is the least k such that phi(k) + d(k) = A357916(n), where phi(k) = A000010(k) is Euler's totient function, and d(k) = A000005(k) is the number of divisors of k.

Table of values

List of values