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.

A353747 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 2
2 2
3 4
4 3
5 7
6 4
7 11
8 5
9 10
10 7
11 17
12 6
13 23
14 11
15 14
16 9
17 29
18 10
19 35
20 11
21 22
22 17
23 41
24 10
25 29
26 23
27 26
28 17
29 51
30 14
31 59
32 17
33 34
34 29
35 39
36 16
37 67
38 35
39 46
40 19
41 77
42 22
43 83
44 27
45 36
46 41
47 89
48 18
49 67
50 29
51 58
52 35
53 99
54 26
55 61
56 29
57 70
58 51
59 111
60 22
61 119
62 59
63 56
64 33
65 81
66 34
67 127
68 45
69 82
70 39
71 137
72 28
73 143
74 67
75 58
76 53
77 95
78 46
79 151
80 35
81 70

List of values

[2, 2, 4, 3, 7, 4, 11, 5, 10, 7, 17, 6, 23, 11, 14, 9, 29, 10, 35, 11, 22, 17, 41, 10, 29, 23, 26, 17, 51, 14, 59, 17, 34, 29, 39, 16, 67, 35, 46, 19, 77, 22, 83, 27, 36, 41, 89, 18, 67, 29, 58, 35, 99, 26, 61, 29, 70, 51, 111, 22, 119, 59, 56, 33, 81, 34, 127, 45, 82, 39, 137, 28, 143, 67, 58, 53, 95, 46, 151, 35, 70]