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.

A035532 a(n) = 2*phi(n) if n composite, or 2*phi(n) - (A000120(n)-1) if n prime, where phi = A000010, Euler's totient function, and a(1) = 1.

Table of values

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

List of values

[1, 2, 3, 4, 7, 4, 10, 8, 12, 8, 18, 8, 22, 12, 16, 16, 31, 12, 34, 16, 24, 20, 41, 16, 40, 24, 36, 24, 53, 16, 56, 32, 40, 32, 48, 24, 70, 36, 48, 32, 78, 24, 81, 40, 48, 44, 88, 32, 84, 40, 64, 48, 101, 36, 80, 48, 72, 56, 112, 32, 116, 60, 72, 64, 96, 40, 130, 64, 88, 48, 137]