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.

A207982 Least m>1 such that all central binomial coefficients C(2k,k), k<=n, are pairwise not congruent mod m.

Table of values

n a(n)
1 2
2 3
3 5
4 11
5 11
6 11
7 23
8 23
9 23
10 31
11 43
12 43
13 43
14 43
15 59
16 59
17 59
18 59
19 107
20 149
21 151
22 151
23 151
24 151
25 163
26 163
27 163
28 163
29 163
30 163
31 163
32 163
33 163
34 277
35 277
36 277
37 277
38 401
39 401
40 457
41 457
42 457
43 457
44 457
45 457
46 457
47 479
48 479
49 479
50 479
51 479
52 479
53 479
54 479
55 479
56 479

List of values

[2, 3, 5, 11, 11, 11, 23, 23, 23, 31, 43, 43, 43, 43, 59, 59, 59, 59, 107, 149, 151, 151, 151, 151, 163, 163, 163, 163, 163, 163, 163, 163, 163, 277, 277, 277, 277, 401, 401, 457, 457, 457, 457, 457, 457, 457, 479, 479, 479, 479, 479, 479, 479, 479, 479, 479]