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.

A306671 a(n) = gcd(tau(n), pod(n)) where tau(k) = the number of the divisors of k (A000005) and pod(k) = the product of the divisors of k (A007955).

Table of values

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

List of values

[1, 2, 1, 1, 1, 4, 1, 4, 3, 4, 1, 6, 1, 4, 1, 1, 1, 6, 1, 2, 1, 4, 1, 8, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 9, 1, 4, 1, 8, 1, 8, 1, 2, 3, 4, 1, 2, 1, 2, 1, 2, 1, 8, 1, 8, 1, 4, 1, 12, 1, 4, 3, 1, 1, 8, 1, 2, 1, 8, 1, 12, 1, 4, 3, 2, 1, 8, 1, 10, 1, 4, 1, 12, 1, 4]