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.

A331479 Table read by rows: row n lists the numbers m such that the first n primes can be partitioned into m subsets all of which have the same sum.

Table of values

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

List of values

[1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 3, 1, 2, 4, 1, 1, 2, 1, 1, 2, 4, 1, 3, 1, 2, 4, 5, 1, 3, 1, 2, 4, 1, 3, 1, 2, 4, 1, 7, 1, 2, 1, 3, 1, 2, 4, 5, 1, 3, 1, 2, 4, 1, 3, 1, 2, 4, 5, 8, 1, 3, 9, 1, 2, 4, 5, 8, 1, 3, 1, 2, 4, 7, 1, 3, 1, 2, 4, 1, 3, 1, 2, 4, 8]