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.

A205523 Numbers k such that gcd(k, sigma(k)) == sigma(k) (mod k).

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 6
6 7
7 11
8 12
9 13
10 17
11 18
12 19
13 20
14 23
15 24
16 28
17 29
18 31
19 37
20 40
21 41
22 43
23 47
24 53
25 56
26 59
27 61
28 67
29 71
30 73
31 79
32 83
33 88
34 89
35 97
36 101
37 103
38 104
39 107
40 109
41 113
42 120
43 127
44 131
45 137
46 139
47 149
48 151
49 157
50 163
51 167
52 173
53 179
54 180
55 181
56 191
57 193
58 196
59 197
60 199

List of values

[1, 2, 3, 5, 6, 7, 11, 12, 13, 17, 18, 19, 20, 23, 24, 28, 29, 31, 37, 40, 41, 43, 47, 53, 56, 59, 61, 67, 71, 73, 79, 83, 88, 89, 97, 101, 103, 104, 107, 109, 113, 120, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 180, 181, 191, 193, 196, 197, 199]