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.

A358165 Irregular triangular array read by rows. T(n,k) is the number of direct sum decompositions V_1 + V_2 + ... + V_m = GF(2)^n with the dimensions of the V_i corresponding to the k-th partition of n in canonical ordering, n >= 0, 1 <= k <= A000041(n).

Table of values

n a(n)
0 1
1 1
2 1
3 3
4 1
5 28
6 28
7 1
8 120
9 280
10 1680
11 840
12 1
13 496
14 9920
15 29760
16 138880
17 277760
18 83328
19 1
20 2016
21 166656
22 499968
23 357120
24 19998720
25 19998720
26 15554560
27 139991040
28 139991040
29 27998208
30 1
31 8128
32 2731008
33 8193024
34 48377856
35 1354579968
36 1354579968
37 2902671360
38 13545799680
39 81274798080
40 40637399040
41 126427463680
42 379282391040
43 227569434624
44 32509919232

List of values

[1, 1, 1, 3, 1, 28, 28, 1, 120, 280, 1680, 840, 1, 496, 9920, 29760, 138880, 277760, 83328, 1, 2016, 166656, 499968, 357120, 19998720, 19998720, 15554560, 139991040, 139991040, 27998208, 1, 8128, 2731008, 8193024, 48377856, 1354579968, 1354579968, 2902671360, 13545799680, 81274798080, 40637399040, 126427463680, 379282391040, 227569434624, 32509919232]