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.

A283757 Numbers n such that phi(n) = Sum_{j=1..k} d(n^j) for some k, where phi(n) is the Euler totient function of n and d(n) is the number of divisors of n.

Table of values

n a(n)
1 1
2 3
3 8
4 10
5 18
6 24
7 30
8 435
9 485
10 579
11 678
12 759
13 1052
14 1593
15 3243
16 3857
17 3913
18 4085
19 4445
20 4773
21 4953
22 5685
23 6078
24 6278
25 6322
26 6836
27 7570
28 9823
29 10199
30 10703
31 12474
32 12913
33 12927
34 14180
35 14511
36 14623
37 16958
38 17013
39 17014
40 17174
41 17518
42 17966
43 18238
44 19334
45 19432

List of values

[1, 3, 8, 10, 18, 24, 30, 435, 485, 579, 678, 759, 1052, 1593, 3243, 3857, 3913, 4085, 4445, 4773, 4953, 5685, 6078, 6278, 6322, 6836, 7570, 9823, 10199, 10703, 12474, 12913, 12927, 14180, 14511, 14623, 16958, 17013, 17014, 17174, 17518, 17966, 18238, 19334, 19432]