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.

A205009 Least k such that n divides the k-th difference between distinct central binomials coefficients.

Table of values

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

List of values

[1, 3, 5, 3, 2, 5, 6, 9, 5, 10, 28, 21, 15, 6, 27, 9, 8, 5, 4, 27, 21, 28, 7, 21, 10, 15, 18, 21, 14, 27, 66, 9, 28, 8, 23, 40, 38, 28, 36, 33, 13, 21, 120, 28, 40, 49, 22, 21, 23, 10, 18, 44, 27, 18, 45, 21, 28, 14, 189, 27]