Table T(n,k) read by antidiagonals: T(n,k) (n >=1, k >= 2) is the number of inversions in the radix-k digit reversal permutation of 0, 1, ..., k^n-1.

A376790

Table T(n,k) read by antidiagonals: T(n,k) (n >=1, k >= 2) is the number of inversions in the radix-k digit reversal permutation of 0, 1, ..., k^n-1.

Terms

    a(0) =0a(1) =0a(2) =1a(3) =0a(4) =9a(5) =8a(6) =0a(7) =36a(8) =135a(9) =44a(10) =0a(11) =100a(12) =864a(13) =1458a(14) =208a(15) =0a(16) =225a(17) =3500a(18) =15552a(19) =14094a(20) =912a(21) =0a(22) =441a(23) =10800a(24) =95000a(25) =258048a(26) =130491a(27) =3840a(28) =0a(29) =784

External references