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.

A206828 Number of solutions k of C(2k,k)=C(2n,n) (mod n), where 1<=k

Table of values

n a(n)
2 1
3 1
4 2
5 1
6 2
7 1
8 2
9 2
10 1
11 1
12 1
13 1
14 2
15 2
16 3
17 2
18 2
19 1
20 8
21 2
22 1
23 1
24 5
25 2
26 1
27 2
28 11
29 1
30 0
31 1
32 4
33 1
34 3
35 4
36 1
37 2
38 1
39 1
40 8
41 1
42 15
43 1
44 2
45 12
46 1
47 1
48 5
49 2
50 3
51 0
52 1
53 3
54 3
55 3
56 1
57 0
58 1
59 1
60 2
61 1
62 1
63 0
64 5
65 2
66 23
67 1
68 4
69 0
70 4
71 1
72 7
73 3
74 1
75 12
76 2
77 24
78 2
79 1
80 8
81 3
82 3
83 1
84 6
85 0
86 3
87 1
88 37
89 1
90 3
91 26
92 1
93 1
94 1
95 0
96 4

List of values

[1, 1, 2, 1, 2, 1, 2, 2, 1, 1, 1, 1, 2, 2, 3, 2, 2, 1, 8, 2, 1, 1, 5, 2, 1, 2, 11, 1, 0, 1, 4, 1, 3, 4, 1, 2, 1, 1, 8, 1, 15, 1, 2, 12, 1, 1, 5, 2, 3, 0, 1, 3, 3, 3, 1, 0, 1, 1, 2, 1, 1, 0, 5, 2, 23, 1, 4, 0, 4, 1, 7, 3, 1, 12, 2, 24, 2, 1, 8, 3, 3, 1, 6, 0, 3, 1, 37, 1, 3, 26, 1, 1, 1, 0, 4]