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.

A210144 a(n) = least integer m>1 such that the product of the first k primes for k=1,...,n are pairwise distinct modulo m.

Table of values

n a(n)
1 2
2 3
3 5
4 11
5 11
6 23
7 29
8 37
9 37
10 41
11 47
12 47
13 47
14 47
15 47
16 73
17 131
18 131
19 131
20 131
21 131
22 151
23 151
24 151
25 151
26 199
27 223
28 223
29 271
30 271
31 271
32 281
33 281
34 281
35 281
36 281
37 281
38 281
39 281
40 281
41 353
42 353
43 457
44 457
45 457
46 457
47 457
48 457
49 457
50 457
51 457
52 641
53 641
54 641
55 641
56 641
57 643
58 643
59 643
60 643

List of values

[2, 3, 5, 11, 11, 23, 29, 37, 37, 41, 47, 47, 47, 47, 47, 73, 131, 131, 131, 131, 131, 151, 151, 151, 151, 199, 223, 223, 271, 271, 271, 281, 281, 281, 281, 281, 281, 281, 281, 281, 353, 353, 457, 457, 457, 457, 457, 457, 457, 457, 457, 641, 641, 641, 641, 641, 643, 643, 643, 643]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.