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.

A070015 Least 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)
1 2
2 0
3 4
4 9
5 0
6 6
7 8
8 10
9 15
10 14
11 21
12 121
13 27
14 22
15 16
16 12
17 39
18 289
19 65
20 34
21 18
22 20
23 57
24 529
25 95
26 46
27 69
28 28
29 115
30 841
31 32
32 58
33 45
34 62
35 93
36 24
37 155
38 1369
39 217
40 44
41 63
42 30
43 50
44 82
45 123
46 52
47 129
48 2209
49 75
50 40
51 141
52 0
53 235
54 42
55 36
56 106
57 99
58 68
59 265
60 3481
61 371
62 118
63 64
64 56

List of values

[2, 0, 4, 9, 0, 6, 8, 10, 15, 14, 21, 121, 27, 22, 16, 12, 39, 289, 65, 34, 18, 20, 57, 529, 95, 46, 69, 28, 115, 841, 32, 58, 45, 62, 93, 24, 155, 1369, 217, 44, 63, 30, 50, 82, 123, 52, 129, 2209, 75, 40, 141, 0, 235, 42, 36, 106, 99, 68, 265, 3481, 371, 118, 64, 56]