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.

A178100 Let B_m be set of divisors 1<=d<=m/2 of binomial(m-d-1,d-1) such that gcd(m,d)>1. The sequence lists m for which the intersection of B_m and B_(m+1) is not empty.

Table of values

n a(n)
1 26
2 45
3 50
4 51
5 54
6 56
7 57
8 62
9 63
10 64
11 65
12 69
13 77
14 80
15 81
16 85
17 86
18 87
19 90
20 92
21 93
22 94
23 98
24 99
25 110
26 114
27 116
28 117
29 118
30 119
31 122
32 123
33 124
34 125
35 128
36 129
37 132
38 133
39 134
40 135
41 140
42 141
43 144
44 146
45 147
46 152
47 153
48 154
49 155
50 158
51 159
52 160
53 161
54 164
55 165
56 170
57 171
58 174
59 175
60 176
61 177
62 182
63 183
64 184

List of values

[26, 45, 50, 51, 54, 56, 57, 62, 63, 64, 65, 69, 77, 80, 81, 85, 86, 87, 90, 92, 93, 94, 98, 99, 110, 114, 116, 117, 118, 119, 122, 123, 124, 125, 128, 129, 132, 133, 134, 135, 140, 141, 144, 146, 147, 152, 153, 154, 155, 158, 159, 160, 161, 164, 165, 170, 171, 174, 175, 176, 177, 182, 183, 184]