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.

A350072 a(n) = sigma(n^2) / gcd(sigma(n^2), A003961(n^2)), where A003961 shifts the prime factorization of n one step towards larger primes, and sigma is the sum of divisors function.

Table of values

n a(n)
1 1
2 7
3 13
4 31
5 31
6 91
7 57
8 127
9 121
10 31
11 133
12 403
13 183
14 133
15 403
16 511
17 307
18 847
19 381
20 961
21 741
22 931
23 553
24 1651
25 781
26 427
27 1093
28 589
29 871
30 403
31 993
32 2047
33 133
34 2149
35 1767
36 3751
37 1407
38 889
39 2379
40 3937
41 1723
42 1729
43 1893
44 4123
45 3751
46 3871
47 2257
48 6643
49 2801
50 781
51 3991
52 1891
53 2863
54 7651
55 589
56 2413
57 4953
58 6097
59 3541
60 12493

List of values

[1, 7, 13, 31, 31, 91, 57, 127, 121, 31, 133, 403, 183, 133, 403, 511, 307, 847, 381, 961, 741, 931, 553, 1651, 781, 427, 1093, 589, 871, 403, 993, 2047, 133, 2149, 1767, 3751, 1407, 889, 2379, 3937, 1723, 1729, 1893, 4123, 3751, 3871, 2257, 6643, 2801, 781, 3991, 1891, 2863, 7651, 589, 2413, 4953, 6097, 3541, 12493]