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.

A210393 a(n) = least integer m>1 such that S_k! for k=1,...,n are pairwise distinct modulo m where S_k is the sum of the first k primes.

Table of values

n a(n)
1 2
2 3
3 7
4 13
5 19
6 29
7 43
8 61
9 79
10 101
11 131
12 167
13 199
14 239
15 293
16 331
17 389
18 443
19 503
20 571
21 641
22 719
23 797
24 877
25 971
26 1063
27 1163
28 1277
29 1373
30 1481
31 1601
32 1721
33 1861
34 1997
35 2131
36 2281
37 2437
38 2591
39 2753
40 2927
41 3089
42 3271
43 3457
44 3659
45 3847
46 4049
47 4231
48 4441
49 4663
50 4889

List of values

[2, 3, 7, 13, 19, 29, 43, 61, 79, 101, 131, 167, 199, 239, 293, 331, 389, 443, 503, 571, 641, 719, 797, 877, 971, 1063, 1163, 1277, 1373, 1481, 1601, 1721, 1861, 1997, 2131, 2281, 2437, 2591, 2753, 2927, 3089, 3271, 3457, 3659, 3847, 4049, 4231, 4441, 4663, 4889]