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.

A334730 a(n) = Product_{d|n} gcd(tau(d), pod(d)) where tau(k) is the number of divisors of k (A000005) and pod(k) is the product of divisors of k (A007955).

Table of values

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

List of values

[1, 2, 1, 2, 1, 8, 1, 8, 3, 8, 1, 48, 1, 8, 1, 8, 1, 144, 1, 16, 1, 8, 1, 1536, 1, 8, 3, 16, 1, 256, 1, 16, 1, 8, 1, 7776, 1, 8, 1, 512, 1, 256, 1, 16, 9, 8, 1, 3072, 1, 16, 1, 16, 1, 1152, 1, 512, 1, 8, 1, 36864, 1, 8, 9, 16, 1, 256, 1, 16, 1, 256, 1, 2985984, 1, 8, 3, 16, 1, 256, 1]