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.

A110601 a(n) = phi(n)*tau(n)^2, where phi is Euler's totient function and tau(n) is the number of divisors of n.

Table of values

n a(n)
1 1
2 4
3 8
4 18
5 16
6 32
7 24
8 64
9 54
10 64
11 40
12 144
13 48
14 96
15 128
16 200
17 64
18 216
19 72
20 288
21 192
22 160
23 88
24 512
25 180
26 192
27 288
28 432
29 112
30 512
31 120
32 576
33 320
34 256
35 384
36 972
37 144
38 288
39 384
40 1024
41 160
42 768
43 168
44 720
45 864
46 352
47 184
48 1600
49 378
50 720
51 512
52 864
53 208
54 1152
55 640

List of values

[1, 4, 8, 18, 16, 32, 24, 64, 54, 64, 40, 144, 48, 96, 128, 200, 64, 216, 72, 288, 192, 160, 88, 512, 180, 192, 288, 432, 112, 512, 120, 576, 320, 256, 384, 972, 144, 288, 384, 1024, 160, 768, 168, 720, 864, 352, 184, 1600, 378, 720, 512, 864, 208, 1152, 640]