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.

A117553 When adding some positive divisors of n in order from lowest divisor to highest divisor, a(n) is lowest sum achievable which is >= n.

Table of values

n a(n)
1 1
2 3
3 4
4 7
5 6
6 6
7 8
8 15
9 13
10 18
11 12
12 16
13 14
14 24
15 24
16 31
17 18
18 21
19 20
20 22
21 32
22 36
23 24
24 24
25 31
26 42
27 40
28 28
29 30
30 42
31 32
32 63
33 48
34 54
35 48
36 37
37 38
38 60
39 56
40 50
41 42
42 54
43 44
44 84
45 78
46 72
47 48
48 52
49 57
50 93
51 72
52 98
53 54
54 66
55 72
56 64
57 80
58 90
59 60
60 78
61 62
62 96
63 104
64 127
65 84
66 78
67 68
68 126
69 96
70 74
71 72

List of values

[1, 3, 4, 7, 6, 6, 8, 15, 13, 18, 12, 16, 14, 24, 24, 31, 18, 21, 20, 22, 32, 36, 24, 24, 31, 42, 40, 28, 30, 42, 32, 63, 48, 54, 48, 37, 38, 60, 56, 50, 42, 54, 44, 84, 78, 72, 48, 52, 57, 93, 72, 98, 54, 66, 72, 64, 80, 90, 60, 78, 62, 96, 104, 127, 84, 78, 68, 126, 96, 74, 72]