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.

A307892 a(n) = lcm(tau(n), pod(n)) / n, where tau(k) = the number of divisors of k (A000005) and pod(n) = the product of divisors of k (A007955).

Table of values

n a(n)
1 1
2 1
3 2
4 6
5 2
6 6
7 2
8 8
9 3
10 10
11 2
12 144
13 2
14 14
15 60
16 320
17 2
18 324
19 2
20 1200
21 84
22 22
23 2
24 13824
25 15
26 26
27 108
28 2352
29 2
30 27000
31 2
32 3072
33 132
34 34
35 140
36 279936
37 2
38 38
39 156
40 64000
41 2
42 74088
43 2
44 5808
45 4050
46 46
47 2
48 26542080
49 21
50 7500
51 204
52 8112
53 2
54 157464
55 220
56 175616
57 228

List of values

[1, 1, 2, 6, 2, 6, 2, 8, 3, 10, 2, 144, 2, 14, 60, 320, 2, 324, 2, 1200, 84, 22, 2, 13824, 15, 26, 108, 2352, 2, 27000, 2, 3072, 132, 34, 140, 279936, 2, 38, 156, 64000, 2, 74088, 2, 5808, 4050, 46, 2, 26542080, 21, 7500, 204, 8112, 2, 157464, 220, 175616, 228]