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.

A353748 a(n) = phi(n) - A064989(n), where phi is Euler totient function, and A064989 shifts the prime factorization one step towards lower primes.

Table of values

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

List of values

[0, 0, 0, 1, 1, 0, 1, 3, 2, 1, 3, 2, 1, 1, 2, 7, 3, 2, 1, 5, 2, 3, 3, 6, 11, 1, 10, 7, 5, 2, 1, 15, 6, 3, 9, 8, 5, 1, 2, 13, 3, 2, 1, 13, 12, 3, 3, 14, 17, 11, 6, 13, 5, 10, 19, 19, 2, 5, 5, 10, 1, 1, 16, 31, 15, 6, 5, 19, 6, 9, 3, 20, 1, 5, 22, 19, 25, 2, 5, 29, 38, 3, 3, 14, 25, 1, 10, 33, 5, 12, 17, 25, 2, 3, 21]