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.

A242310 Largest 1 < k <= A000005(n) such that the sum of k distinct divisors of n is equal to k*m for some m, or 1 if no such k exists.

Table of values

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

List of values

[1, 1, 2, 2, 2, 4, 2, 2, 2, 2, 2, 5, 2, 2, 4, 3, 2, 5, 2, 6, 4, 4, 2, 7, 2, 2, 4, 5, 2, 8, 2, 4, 4, 3, 4, 8, 2, 4, 4, 7, 2, 8, 2, 6, 6, 4, 2, 11, 3, 4, 4, 5, 2, 8, 4, 8, 4, 2, 2, 12, 2, 4, 5, 6, 4, 8, 2, 6, 4, 8, 2, 11, 2, 2, 4, 4, 2, 8, 4, 2, 2, 11, 4, 4, 4]