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.

A066420 Least m such that card(invphi(phi(m)))=n.

Table of values

n a(n)
2 1
3 3
4 5
5 15
6 13
7 51
8 37
9 41
10 35
11 65
12 187
13 397
14 2269
15 1059
16 313
17 73
18 337
19 247
20 937
21 185
22 689
23 1139
24 2057
25 403
26 2827
27 485
28 323
29 1321
30 3697
31 241
32 769
33 9001
34 433
35 7129
36 4201
37 527
38 577
39 1297
40 1201
41 15937
42 3313
43 3281
44 3379
45 949
46 3121
47 7519
48 3889
49 779
50 1763

List of values

[1, 3, 5, 15, 13, 51, 37, 41, 35, 65, 187, 397, 2269, 1059, 313, 73, 337, 247, 937, 185, 689, 1139, 2057, 403, 2827, 485, 323, 1321, 3697, 241, 769, 9001, 433, 7129, 4201, 527, 577, 1297, 1201, 15937, 3313, 3281, 3379, 949, 3121, 7519, 3889, 779, 1763]