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.

A324527 a(n) = the smallest number m such that gcd(sigma(m), pod(m)) = 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 10
3 15
4 12
5 95
6 180
7 91
8 56
9 51
10 40
11 473
12 6
13 117
14 980
15 135
16 70
17 1139
18 90
19 703
20 290
21 861
22 26378
23 3151
24 54
25 745
26 468
27 255
28 2156
29 5017
30 26100
31 775
32 124
33 1419
34 2176
35 4865
36 96
37 2701
38 26714
39 585
40 190
41 6683
42 65268
43 11051
44 5632
45 435
46 144946
47 13207
48 42
49 679
50 5800

List of values

[1, 10, 15, 12, 95, 180, 91, 56, 51, 40, 473, 6, 117, 980, 135, 70, 1139, 90, 703, 290, 861, 26378, 3151, 54, 745, 468, 255, 2156, 5017, 26100, 775, 124, 1419, 2176, 4865, 96, 2701, 26714, 585, 190, 6683, 65268, 11051, 5632, 435, 144946, 13207, 42, 679, 5800]