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.

A178105 Let B_n be the set of divisors 2 <= d <= n/2 of binomial(n-d-1,d-1) such that gcd(n,d)>1. The sequence lists the minimal d of B_n, or a(n)=0 if B_n is empty.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 6, 0, 6, 0, 0, 0, 4, 0, 0, 0, 6, 6, 10, 0, 4, 0, 6, 0, 6, 0, 14, 0, 4, 9, 6, 0, 8, 0, 8, 6, 4, 0, 10, 0, 6, 15, 12, 0, 4, 20, 6, 18, 6, 0, 18, 0, 4, 6, 6, 10, 9, 0, 14, 9, 4, 0, 6, 0, 6, 12, 8, 21, 4, 0, 6, 6, 6, 0, 16, 20, 4, 18, 6, 0, 6, 28, 10, 9, 4, 15, 9, 0, 6, 6, 14]