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.

A306682 a(n) = gcd(sigma(n), pod(n)) where sigma(k) = the sum of the divisors of k (A000203) and pod(k) = the product of the divisors of k (A007955).

Table of values

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

List of values

[1, 1, 1, 1, 1, 12, 1, 1, 1, 2, 1, 4, 1, 4, 3, 1, 1, 3, 1, 2, 1, 4, 1, 12, 1, 2, 1, 56, 1, 72, 1, 1, 3, 2, 1, 1, 1, 4, 1, 10, 1, 48, 1, 4, 3, 4, 1, 4, 1, 1, 9, 2, 1, 24, 1, 8, 1, 2, 1, 24, 1, 4, 1, 1, 1, 144, 1, 2, 3, 16, 1, 3, 1, 2, 1, 4, 1, 24, 1, 2, 1, 2, 1]