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.

A060609 Repeatedly apply Euler phi to n-th prime; a(n) = highest power of 2 that is seen.

Table of values

n a(n)
1 2
2 2
3 4
4 2
5 4
6 4
7 16
8 2
9 4
10 4
11 8
12 4
13 16
14 4
15 4
16 8
17 4
18 16
19 8
20 8
21 8
22 8
23 16
24 16
25 32
26 16
27 32
28 8
29 4
30 16
31 4
32 16
33 64
34 8
35 8
36 16
37 16
38 2
39 16
40 8
41 16
42 16
43 8
44 64
45 8
46 16
47 16
48 8
49 16
50 8
51 16
52 32
53 64
54 16
55 256
56 16
57 16
58 8
59 16
60 32
61 8
62 16
63 32
64 32
65 32
66 16
67 32
68 32
69 8
70 16
71 64
72 16
73 32
74 32
75 4
76 8
77 64
78 32
79 64
80 128

List of values

[2, 2, 4, 2, 4, 4, 16, 2, 4, 4, 8, 4, 16, 4, 4, 8, 4, 16, 8, 8, 8, 8, 16, 16, 32, 16, 32, 8, 4, 16, 4, 16, 64, 8, 8, 16, 16, 2, 16, 8, 16, 16, 8, 64, 8, 16, 16, 8, 16, 8, 16, 32, 64, 16, 256, 16, 16, 8, 16, 32, 8, 16, 32, 32, 32, 16, 32, 32, 8, 16, 64, 16, 32, 32, 4, 8, 64, 32, 64, 128]