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.

A342665 Numbers k for which phi(k)+1 is a multiple of d(k), where phi is Euler totient function (A000010) and d(n) gives the number of divisors of n (A000005).

Table of values

n a(n)
1 1
2 2
3 4
4 25
5 81
6 121
7 289
8 529
9 841
10 1681
11 2209
12 2809
13 3481
14 5041
15 6889
16 7921
17 10201
18 11449
19 12100
20 12769
21 17161
22 18769
23 22201
24 27889
25 28561
26 28900
27 29929
28 32041
29 36481
30 38809
31 51529
32 54289
33 57121
34 63001
35 66049
36 69169
37 72361
38 78961
39 84100
40 85849
41 96721
42 100489
43 120409
44 124609
45 128881
46 146689
47 151321
48 160801
49 175561

List of values

[1, 2, 4, 25, 81, 121, 289, 529, 841, 1681, 2209, 2809, 3481, 5041, 6889, 7921, 10201, 11449, 12100, 12769, 17161, 18769, 22201, 27889, 28561, 28900, 29929, 32041, 36481, 38809, 51529, 54289, 57121, 63001, 66049, 69169, 72361, 78961, 84100, 85849, 96721, 100489, 120409, 124609, 128881, 146689, 151321, 160801, 175561]