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.

A210394 a(n) = least integer m>1 such that m divides none of S_i!+S_j! with 0 where S_k is the sum of the first k primes.

Table of values

n a(n)
1 2
2 3
3 7
4 11
5 19
6 31
7 43
8 67
9 79
10 101
11 131
12 163
13 199
14 241
15 283
16 331
17 383
18 443
19 503
20 571
21 641
22 719
23 797
24 877
25 967
26 1061
27 1163
28 1277
29 1373
30 1481
31 1597
32 1721
33 1871
34 1999
35 2129
36 2281
37 2437
38 2593
39 2749
40 2927
41 3089
42 3271
43 3457
44 3643
45 3833
46 4057
47 4229
48 4441
49 4673
50 4889

List of values

[2, 3, 7, 11, 19, 31, 43, 67, 79, 101, 131, 163, 199, 241, 283, 331, 383, 443, 503, 571, 641, 719, 797, 877, 967, 1061, 1163, 1277, 1373, 1481, 1597, 1721, 1871, 1999, 2129, 2281, 2437, 2593, 2749, 2927, 3089, 3271, 3457, 3643, 3833, 4057, 4229, 4441, 4673, 4889]