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.

A349177 Odd numbers k for which gcd(k, A003961(k)) = gcd(sigma(k), A003961(k)) = 1, 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 3
3 5
4 7
5 9
6 11
7 13
8 17
9 19
10 21
11 23
12 25
13 29
14 31
15 33
16 37
17 39
18 41
19 43
20 47
21 49
22 51
23 53
24 55
25 59
26 61
27 63
28 67
29 69
30 71
31 73
32 79
33 81
34 83
35 85
36 89
37 91
38 93
39 95
40 97
41 101
42 103
43 107
44 109
45 111
46 113
47 115
48 117
49 119
50 121
51 123
52 125
53 127
54 129
55 131
56 133
57 137
58 139
59 141
60 145
61 147
62 149
63 151
64 153
65 155
66 157
67 159
68 161
69 163
70 167
71 169
72 173

List of values

[1, 3, 5, 7, 9, 11, 13, 17, 19, 21, 23, 25, 29, 31, 33, 37, 39, 41, 43, 47, 49, 51, 53, 55, 59, 61, 63, 67, 69, 71, 73, 79, 81, 83, 85, 89, 91, 93, 95, 97, 101, 103, 107, 109, 111, 113, 115, 117, 119, 121, 123, 125, 127, 129, 131, 133, 137, 139, 141, 145, 147, 149, 151, 153, 155, 157, 159, 161, 163, 167, 169, 173]