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.

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

Table of values

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

List of values

[2, 3, 4, 3, 3, 4, 4, 5, 4, 5, 8, 7, 6, 4, 8, 5, 5, 4, 4, 8, 7, 8, 5, 7, 5, 6, 7, 7, 6, 8, 12, 5, 8, 5, 8, 10, 10, 8, 9, 9, 6, 7, 16, 8, 10, 11, 8, 7, 8, 5, 7, 10, 8, 7, 10, 7, 8, 6, 20, 8]