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.

A098068 If C is a doubly-even binary code of length N=24m+n, 1 <= n <= 24, then the minimum distance of C^perp is bounded above by 4m+a(n).

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 1
6 2
7 3
8 4
9 1
10 2
11 2
12 2
13 2
14 3
15 3
16 4
17 4
18 4
19 3
20 4
21 5
22 6
23 7
24 8

List of values

[1, 1, 1, 2, 1, 2, 3, 4, 1, 2, 2, 2, 2, 3, 3, 4, 4, 4, 3, 4, 5, 6, 7, 8]