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.

A333633 Smallest m such that sigma(m) == 2*n (mod phi(m)) or 0 if no solution exists.

Table of values

n a(n)
0 1
1 5
2 24
3 22
4 21
5 40
6 48
7 136
8 110
9 90
10 88
11 656
12 102
13 80
14 96
15 68
16 55
17 464
18 65
19 117
20 91
21 116
22 85
23 272
24 95
25 148
26 133
27 164
28 115
29 160
30 147
31 333
32 247
33 212
34 145
35 243968
36 155
37 244
38 217
39 405
40 230
41 11072
42 185
43 292
44 259
45 1184
46 205
47 237824
48 215
49 657
50 301
51 356
52 189
53 343
54 329
55 388
56 559
57 404

List of values

[1, 5, 24, 22, 21, 40, 48, 136, 110, 90, 88, 656, 102, 80, 96, 68, 55, 464, 65, 117, 91, 116, 85, 272, 95, 148, 133, 164, 115, 160, 147, 333, 247, 212, 145, 243968, 155, 244, 217, 405, 230, 11072, 185, 292, 259, 1184, 205, 237824, 215, 657, 301, 356, 189, 343, 329, 388, 559, 404]