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.

A349161 a(n) = A003961(n) / gcd(sigma(n), A003961(n)), 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 1
3 5
4 9
5 7
6 5
7 11
8 9
9 25
10 7
11 13
12 45
13 17
14 11
15 35
16 81
17 19
18 25
19 23
20 3
21 55
22 13
23 29
24 9
25 49
26 17
27 25
28 99
29 31
30 35
31 37
32 27
33 65
34 19
35 77
36 225
37 41
38 23
39 85
40 21
41 43
42 55
43 47
44 39
45 175
46 29
47 53
48 405
49 121
50 49
51 95
52 153
53 59
54 25
55 91
56 99
57 23
58 31
59 61
60 15
61 67
62 37
63 275
64 729
65 17
66 65
67 71
68 19
69 145
70 77
71 73
72 45
73 79
74 41
75 245
76 207
77 143
78 85
79 83

List of values

[1, 1, 5, 9, 7, 5, 11, 9, 25, 7, 13, 45, 17, 11, 35, 81, 19, 25, 23, 3, 55, 13, 29, 9, 49, 17, 25, 99, 31, 35, 37, 27, 65, 19, 77, 225, 41, 23, 85, 21, 43, 55, 47, 39, 175, 29, 53, 405, 121, 49, 95, 153, 59, 25, 91, 99, 23, 31, 61, 15, 67, 37, 275, 729, 17, 65, 71, 19, 145, 77, 73, 45, 79, 41, 245, 207, 143, 85, 83]