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.

A331541 a(n) is the maximum number of equal-sum subsets into which the first n primes can be partitioned.

Table of values

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

List of values

[1, 1, 2, 1, 2, 1, 2, 1, 2, 3, 4, 1, 2, 1, 4, 3, 5, 3, 4, 3, 4, 7, 2, 3, 5, 3, 4, 3, 8, 9, 8, 3, 7, 3, 4, 3, 8, 1, 2, 9, 2, 9, 2, 3, 4, 3, 14, 1, 13, 7, 10, 9, 11, 3, 2, 7, 10, 1, 2, 1, 13, 5, 14, 1, 2, 1, 13, 3, 11, 19, 10, 7, 2, 9, 2, 11, 19, 9, 19, 23, 4, 3]