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.

A269423 a(n) is the sum of all 0 < m < n for which n == a(m) (mod m).

Table of values

n a(n)
1 1
2 1
3 3
4 1
5 7
6 4
7 8
8 8
9 10
10 16
11 3
12 9
13 7
14 12
15 13
16 25
17 12
18 4
19 12
20 14
21 22
22 58
23 3
24 12
25 34
26 48
27 11
28 31
29 31
30 4
31 79
32 14
33 35
34 82
35 36
36 113
37 21
38 28
39 6
40 47
41 59
42 9
43 46
44 1
45 105
46 131
47 59
48 103
49 30
50 27
51 48
52 12
53 7
54 38
55 60
56 19
57 50
58 110
59 157
60 210
61 7
62 6
63 23
64 134

List of values

[1, 1, 3, 1, 7, 4, 8, 8, 10, 16, 3, 9, 7, 12, 13, 25, 12, 4, 12, 14, 22, 58, 3, 12, 34, 48, 11, 31, 31, 4, 79, 14, 35, 82, 36, 113, 21, 28, 6, 47, 59, 9, 46, 1, 105, 131, 59, 103, 30, 27, 48, 12, 7, 38, 60, 19, 50, 110, 157, 210, 7, 6, 23, 134]