Irregular triangle read by rows: T(n, k) is the number of chains of subspaces 0 < V_1 < ... < V_r = (F_2)^n, counted up to coordinate permutation, with dimension increments given by (any fixed permutation of) the parts of the k-th partition of n in Abramowitz-Stegun order.

A348113

Irregular triangle read by rows: T(n, k) is the number of chains of subspaces 0 < V_1 < ... < V_r = (F_2)^n, counted up to coordinate permutation, with dimension increments given by (any fixed permutation of) the parts of the k-th partition of n in Abramowitz-Stegun order.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =1a(4) =3a(5) =6a(6) =1a(7) =4a(8) =6a(9) =13a(10) =28a(11) =1a(12) =5a(13) =10a(14) =23a(15) =37a(16) =85a(17) =196a(18) =1a(19) =6a(20) =16a(21) =22a(22) =37a(23) =87a(24) =149a(25) =207a(26) =357a(27) =864a(28) =2109a(29) =1

External references