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.

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

Table of values

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

List of values

[2, 2, 4, 4, 6, 6, 8, 8, 8, 12, 16, 12, 20, 16, 18, 16, 20, 24, 24, 24, 32, 24, 24, 40, 32, 48, 36, 40, 32, 48, 40, 44, 48, 40, 48, 54, 80, 48, 56, 48, 60, 64, 84, 60, 48, 72, 96, 72, 88, 72, 64, 80, 72, 84, 80, 72, 88, 96, 92, 96, 80, 120, 96, 144, 80, 96, 108, 112, 120, 116]