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.

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

Table of values

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

List of values

[2, 2, 3, 4, 4, 6, 3, 4, 3, 7, 7, 6, 5, 6, 7, 4, 4, 9, 7, 8, 6, 7, 10, 6, 4, 9, 6, 6, 5, 7, 11, 4, 7, 4, 7, 9, 9, 7, 8, 8, 5, 6, 15, 9, 9, 10, 13, 6, 7, 8]