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.

A248124 Least integer m > 0 such that gcd(m,n) = 1 and (m+n) | (C(m)+C(n)), where C(k) refers to the k-th Catalan number, binomial(2k,k)/(k+1).

Table of values

n a(n)
4 1
5 19
6 1
7 20
8 1
9 95
10 1
11 4
12 1
13 242
14 241
15 478
16 1
17 23
18 1
19 5
20 7
21 109
22 1
23 17
24 1
25 227
26 467
27 37
28 1
29 209
30 1
31 330
32 2077
33 17
34 1073
35 816
36 1
37 27
38 109
39 71
40 1
41 43
42 1
43 41
44 145
45 151
46 1
47 43
48 1
49 59
50 71
51 587
52 1
53 87
54 1775
55 344
56 1773
57 1127
58 1
59 49
60 1

List of values

[1, 19, 1, 20, 1, 95, 1, 4, 1, 242, 241, 478, 1, 23, 1, 5, 7, 109, 1, 17, 1, 227, 467, 37, 1, 209, 1, 330, 2077, 17, 1073, 816, 1, 27, 109, 71, 1, 43, 1, 41, 145, 151, 1, 43, 1, 59, 71, 587, 1, 87, 1775, 344, 1773, 1127, 1, 49, 1]