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.

A061108 Compute Euler totient function for the prime(n+1)-prime(n)-1 composite numbers between two consecutive primes; choose the largest.

Table of values

n a(n)
2 2
3 2
4 6
5 4
6 8
7 6
8 12
9 20
10 8
11 24
12 24
13 12
14 24
15 42
16 40
17 16
18 48
19 44
20 24
21 60
22 54
23 64
24 72
25 60
26 32
27 52
28 36
29 72
30 110
31 84
32 108
33 44
34 120
35 40
36 120
37 132
38 82
39 156
40 120
41 48
42 160
43 64
44 96
45 60
46 180
47 192
48 120
49 72
50 120
51 184
52 64
53 216
54 220
55 216
56 208
57 72
58 200
59 180
60 92
61 272
62 264
63 204
64 96

List of values

[2, 2, 6, 4, 8, 6, 12, 20, 8, 24, 24, 12, 24, 42, 40, 16, 48, 44, 24, 60, 54, 64, 72, 60, 32, 52, 36, 72, 110, 84, 108, 44, 120, 40, 120, 132, 82, 156, 120, 48, 160, 64, 96, 60, 180, 192, 120, 72, 120, 184, 64, 216, 220, 216, 208, 72, 200, 180, 92, 272, 264, 204, 96]