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.

A373469 Least odd k such that C(2k, k) == 1 (mod A007775(n)), or 0 if no such k exists.

Table of values

n a(n)
1 1
2 17
3 13
4 2383
5 37
6 3
7 3391
8 185
9 129
10 419
11 95
12 139
13 7
14 7373
15 497
16 21
17 89
18 27
19 319
20 7
21 23
22 191
23 277
24 25
25 33635
26 137
27 1957
28 347
29 879
30 889
31 47
32 57
33 411
34 263
35 63
36 57
37 63
38 143
39 62561
40 363
41 1679
42 861
43 285735
44 1017
45 545
46 2605
47 913
48 1873
49 735
50 206349
51 817
52 407
53 485
54 49
55 7605
56 179817

List of values

[1, 17, 13, 2383, 37, 3, 3391, 185, 129, 419, 95, 139, 7, 7373, 497, 21, 89, 27, 319, 7, 23, 191, 277, 25, 33635, 137, 1957, 347, 879, 889, 47, 57, 411, 263, 63, 57, 63, 143, 62561, 363, 1679, 861, 285735, 1017, 545, 2605, 913, 1873, 735, 206349, 817, 407, 485, 49, 7605, 179817]