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.

A363702 Let m be the least integer for which there exists a strictly increasing sequence u of n integers in {1..m} such that x = (2 * Sum_{k=1..n} k*prime(u(k))) / (n*(n+1)) is an integer. a(n) is the least x, or -1 if no such integer x exists.

Table of values

n a(n)
1 2
2 4
3 11
4 12
5 12
6 12
7 16
8 21
9 24
10 22
11 24
12 31
13 32
14 34
15 41
16 40
17 42
18 44
19 49
20 50
21 52
22 52
23 61
24 63
25 62
26 68
27 70
28 75
29 74
30 82
31 88
32 89
33 92
34 92
35 102
36 106
37 106
38 106
39 113
40 118
41 118
42 118
43 125
44 127
45 132
46 132
47 141
48 148
49 142
50 150
51 154
52 158
53 158
54 162
55 171
56 175
57 172
58 178
59 181
60 187

List of values

[2, 4, 11, 12, 12, 12, 16, 21, 24, 22, 24, 31, 32, 34, 41, 40, 42, 44, 49, 50, 52, 52, 61, 63, 62, 68, 70, 75, 74, 82, 88, 89, 92, 92, 102, 106, 106, 106, 113, 118, 118, 118, 125, 127, 132, 132, 141, 148, 142, 150, 154, 158, 158, 162, 171, 175, 172, 178, 181, 187]