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.

A351561 a(n) = n + d(n) - phi(n), where d is the number of divisors function, and phi is the Euler totient function.

Table of values

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

List of values

[1, 3, 3, 5, 3, 8, 3, 8, 6, 10, 3, 14, 3, 12, 11, 13, 3, 18, 3, 18, 13, 16, 3, 24, 8, 18, 13, 22, 3, 30, 3, 22, 17, 22, 15, 33, 3, 24, 19, 32, 3, 38, 3, 30, 27, 28, 3, 42, 10, 36, 23, 34, 3, 44, 19, 40, 25, 34, 3, 56, 3, 36, 33, 39, 21, 54, 3, 42, 29, 54, 3, 60, 3, 42, 41, 46, 21, 62, 3, 58, 32, 46, 3, 72, 25, 48]