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.

A225561 Largest number m such that 1, 2, ..., m can be represented as the sum of distinct divisors of n.

Table of values

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

List of values

[1, 3, 1, 7, 1, 12, 1, 15, 1, 3, 1, 28, 1, 3, 1, 31, 1, 39, 1, 42, 1, 3, 1, 60, 1, 3, 1, 56, 1, 72, 1, 63, 1, 3, 1, 91, 1, 3, 1, 90, 1, 96, 1, 7, 1, 3, 1, 124, 1, 3, 1, 7, 1, 120, 1, 120, 1, 3, 1, 168, 1, 3, 1, 127, 1, 144, 1, 7, 1, 3, 1, 195, 1, 3, 1, 7, 1, 168, 1, 186, 1, 3]