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.

A354101 a(n) = phi(A267099(n)) - phi(n), where A267099 is fully multiplicative involution swapping the positions of 4k+1 and 4k+3 primes, and phi is Euler totient function.

Table of values

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

List of values

[0, 0, 2, 0, -2, 2, 6, 0, 14, -2, 6, 4, -6, 6, 0, 0, -6, 14, 10, -4, 36, 6, 14, 8, -14, -6, 82, 12, -10, 0, 10, 0, 44, -6, 0, 28, -14, 10, 0, -8, -10, 36, 10, 12, 16, 14, 14, 16, 114, -14, 8, -12, -10, 82, -8, 24, 76, -10, 14, 0, -14, 10, 204, 0, -36, 44, 22, -12, 100, 0, 26, 56, -14, -14, -16, 20, 132, 0, 22, -16]