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.

A191965 A problem of Zarankiewicz: maximal number of 1's in a symmetric n X n matrix of 0's and 1's with 0's on the main diagonal and no "rectangle" with 1's at the four corners.

Table of values

n a(n)
1 0
2 2
3 6
4 8
5 12
6 14
7 18
8 22
9 26
10 32
11 36
12 42
13 48
14 54
15 60
16 66
17 72
18 78
19 84
20 92
21 100
22 104
23 112
24 118
25 126
26 134
27 142
28 152
29 160
30 170
31 180
32 184
33 192
34 204
35 212
36 220
37 226
38 234
39 244
40 254

List of values

[0, 2, 6, 8, 12, 14, 18, 22, 26, 32, 36, 42, 48, 54, 60, 66, 72, 78, 84, 92, 100, 104, 112, 118, 126, 134, 142, 152, 160, 170, 180, 184, 192, 204, 212, 220, 226, 234, 244, 254]