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.

A205012 Least s(k) such that n divides s(k)-s(j) for some j where s(j)=C(2j-2,j-1).

Table of values

n a(n)
1 2
2 6
3 20
4 6
5 6
6 20
7 20
8 70
9 20
10 70
11 3432
12 924
13 252
14 20
15 3432
16 70
17 70
18 20
19 20
20 3432
21 924
22 3432
23 70
24 924
25 70
26 252
27 924
28 924
29 252
30 3432
31 705432
32 70
33 3432
34 70
35 3432
36 48620
37 48620
38 3432
39 12870
40 12870
41 252
42 924
43 155117520
44 3432
45 48620
46 184756
47 3432

List of values

[2, 6, 20, 6, 6, 20, 20, 70, 20, 70, 3432, 924, 252, 20, 3432, 70, 70, 20, 20, 3432, 924, 3432, 70, 924, 70, 252, 924, 924, 252, 3432, 705432, 70, 3432, 70, 3432, 48620, 48620, 3432, 12870, 12870, 252, 924, 155117520, 3432, 48620, 184756, 3432]