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.

A034254 Triangle read by rows giving T(n,k) = number of inequivalent indecomposable linear [ n,k ] binary codes without 0 columns (n >= 2, 1 <= k <= n).

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 2
9 2
10 1
11 1
12 3
13 5
14 3
15 1
16 1
17 4
18 10
19 10
20 4
21 1
22 1
23 5
24 18
25 28
26 18
27 5
28 1
29 1
30 7
31 31
32 71
33 71
34 31
35 7
36 1
37 1
38 8
39 51
40 165
41 250
42 165
43 51
44 8
45 1
46 1
47 10
48 79
49 361
50 809
51 809
52 361
53 79
54 10
55 1
56 1
57 12
58 121
59 754
60 2484
61 3759
62 2484
63 754
64 121
65 12
66 1
67 1
68 14
69 177
70 1503
71 7240
72 16749
73 16749
74 7240
75 1503
76 177
77 14
78 1

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 3, 5, 3, 1, 1, 4, 10, 10, 4, 1, 1, 5, 18, 28, 18, 5, 1, 1, 7, 31, 71, 71, 31, 7, 1, 1, 8, 51, 165, 250, 165, 51, 8, 1, 1, 10, 79, 361, 809, 809, 361, 79, 10, 1, 1, 12, 121, 754, 2484, 3759, 2484, 754, 121, 12, 1, 1, 14, 177, 1503, 7240, 16749, 16749, 7240, 1503, 177, 14, 1]