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.

A351124 a(n) is the least k > 0 such that the set { prime(n), ..., prime(n+k-1) } can be partitioned into two disjoint sets with equal sum, or -1 if no such k exists (prime(n) denotes the n-th prime number).

Table of values

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

List of values

[3, 6, 4, 4, 4, 4, 8, 10, 4, 8, 8, 4, 10, 14, 6, 4, 6, 6, 8, 8, 4, 8, 12, 10, 4, 4, 4, 8, 4, 8, 6, 10, 4, 6, 8, 18, 4, 6, 8, 6, 4, 12, 4, 8, 10, 6, 10, 4, 8, 6, 8, 12, 10, 4, 6, 4, 8, 8, 10, 8, 12, 8, 4, 12, 6, 6, 8, 8, 14, 8, 4, 8, 10, 4, 10, 6, 4, 10, 8, 4, 4]