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.

A348992 a(n) = A000265(sigma(n)) / gcd(sigma(n), A003961(n)), where A003961(n) is fully multiplicative with a(prime(k)) = prime(k+1), and sigma is the sum of divisors function.

Table of values

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

List of values

[1, 1, 1, 7, 3, 1, 1, 5, 13, 3, 3, 7, 7, 1, 3, 31, 9, 13, 5, 1, 1, 3, 3, 1, 31, 7, 1, 7, 15, 3, 1, 7, 3, 9, 3, 91, 19, 5, 7, 5, 21, 1, 11, 7, 39, 3, 3, 31, 57, 31, 9, 49, 27, 1, 9, 5, 1, 15, 15, 1, 31, 1, 13, 127, 3, 3, 17, 7, 3, 3, 9, 13, 37, 19, 31, 35, 3, 7, 5, 31, 121, 21, 21, 7, 27, 11, 3, 5, 45, 39, 7, 7, 1, 3]