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.

A232898 Least positive integer m such that {C(2k,k) + k: k = 1,...,m} contains a complete system of residues modulo n, or 0 if such a number m does not exist.

Table of values

n a(n)
1 1
2 2
3 7
4 5
5 10
6 12
7 9
8 24
9 31
10 22
11 59
12 25
13 27
14 30
15 42
16 56
17 123
18 66
19 57
20 72
21 84
22 78
23 73
24 132
25 136
26 57
27 99
28 80
29 129
30 211
31 170
32 226
33 121
34 170
35 126
36 129
37 238
38 218
39 157
40 132
41 348
42 198
43 388
44 103
45 171
46 166
47 247
48 181
49 205
50 352
51 194
52 136
53 430
54 226
55 117
56 224
57 237
58 292
59 364
60 241

List of values

[1, 2, 7, 5, 10, 12, 9, 24, 31, 22, 59, 25, 27, 30, 42, 56, 123, 66, 57, 72, 84, 78, 73, 132, 136, 57, 99, 80, 129, 211, 170, 226, 121, 170, 126, 129, 238, 218, 157, 132, 348, 198, 388, 103, 171, 166, 247, 181, 205, 352, 194, 136, 430, 226, 117, 224, 237, 292, 364, 241]