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.

A135244 Largest m such that the sum of the aliquot parts of m (A001065) equals n, or 0 if no such number exists.

Table of values

n a(n)
2 0
3 4
4 9
5 0
6 25
7 8
8 49
9 15
10 14
11 21
12 121
13 35
14 169
15 33
16 26
17 55
18 289
19 77
20 361
21 91
22 38
23 85
24 529
25 143
26 46
27 133
28 28
29 187
30 841
31 221
32 961
33 247
34 62
35 253
36 24
37 323
38 1369
39 217
40 81
41 391
42 1681
43 437
44 1849
45 403
46 86
47 493
48 2209
49 551
50 94
51 589
52 0
53 667
54 2809
55 713
56 106
57 703
58 68
59 697
60 3481

List of values

[0, 4, 9, 0, 25, 8, 49, 15, 14, 21, 121, 35, 169, 33, 26, 55, 289, 77, 361, 91, 38, 85, 529, 143, 46, 133, 28, 187, 841, 221, 961, 247, 62, 253, 24, 323, 1369, 217, 81, 391, 1681, 437, 1849, 403, 86, 493, 2209, 551, 94, 589, 0, 667, 2809, 713, 106, 703, 68, 697, 3481]