Identity
The sequence A181983 (n) gives the determinants of the square matrices: M n M_{n} M n , where the elements m i , j = max ( i , j ) m_{i,j}= \max(i,j) m i , j = max ( i , j ) and max \max max denotes the maximum function.
This identity appears as follows:
d e t [ m a x ( i , j ) ] 1 ≤ i , j ≤ n = − n ⋅ ( − 1 ) n = A 181983 ( n ) \begin{equation}
det{\bigg[ max(i,j) \bigg] }_{1\leq i,j \leq n} = -n \cdot {(-1)}^{n} = A181983(n)
\end{equation} d e t [ ma x ( i , j ) ] 1 ≤ i , j ≤ n = − n ⋅ ( − 1 ) n = A 181983 ( n )
Proof
A new matrix with the same determinant can be created by subtracting row i i i from row i + 1 i+1 i + 1 starting from the 2nd row. The determinant of this new matrix can then be easily computed using the expansion by minors technique at element m 1 , n m_{1,n} m 1 , n
This can be better illustrated with an example:
We can transform:
M 10 = ( 1 2 3 4 5 6 7 8 9 10 2 2 3 4 5 6 7 8 9 10 3 3 3 4 5 6 7 8 9 10 4 4 4 4 5 6 7 8 9 10 5 5 5 5 5 6 7 8 9 10 6 6 6 6 6 6 7 8 9 10 7 7 7 7 7 7 7 8 9 10 8 8 8 8 8 8 8 8 9 10 9 9 9 9 9 9 9 9 9 10 10 10 10 10 10 10 10 10 10 10 ) \begin{equation}
M_{10} = \left(\begin{array}{cccccccccc}
1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10 \\
2 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10 \\
3 & 3 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10 \\
4 & 4 & 4 & 4 & 5 & 6 & 7 & 8 & 9 & 10 \\
5 & 5 & 5 & 5 & 5 & 6 & 7 & 8 & 9 & 10 \\
6 & 6 & 6 & 6 & 6 & 6 & 7 & 8 & 9 & 10 \\
7 & 7 & 7 & 7 & 7 & 7 & 7 & 8 & 9 & 10 \\
8 & 8 & 8 & 8 & 8 & 8 & 8 & 8 & 9 & 10 \\
9 & 9 & 9 & 9 & 9 & 9 & 9 & 9 & 9 & 10 \\
10 & 10 & 10 & 10 & 10 & 10 & 10 & 10 & 10 & 10
\end{array} \right)
\end{equation} M 10 = 1 2 3 4 5 6 7 8 9 10 2 2 3 4 5 6 7 8 9 10 3 3 3 4 5 6 7 8 9 10 4 4 4 4 5 6 7 8 9 10 5 5 5 5 5 6 7 8 9 10 6 6 6 6 6 6 7 8 9 10 7 7 7 7 7 7 7 8 9 10 8 8 8 8 8 8 8 8 9 10 9 9 9 9 9 9 9 9 9 10 10 10 10 10 10 10 10 10 10 10
Into:
M 10 ∗ = ( 1 2 3 4 5 6 7 8 9 10 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 1 0 0 0 0 1 1 1 1 1 1 1 0 0 0 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 0 ) \begin{equation}
M^{*}_{10} =\left(\begin{array}{cccccccccc}
1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10 \\
1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\
1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\
1 & 1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\
1 & 1 & 1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 \\
1 & 1 & 1 & 1 & 1 & 0 & 0 & 0 & 0 & 0 \\
1 & 1 & 1 & 1 & 1 & 1 & 0 & 0 & 0 & 0 \\
1 & 1 & 1 & 1 & 1 & 1 & 1 & 0 & 0 & 0 \\
1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 0 & 0 \\
1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 0 \end{array} \right)
\end{equation} M 10 ∗ = 1 1 1 1 1 1 1 1 1 1 2 0 1 1 1 1 1 1 1 1 3 0 0 1 1 1 1 1 1 1 4 0 0 0 1 1 1 1 1 1 5 0 0 0 0 1 1 1 1 1 6 0 0 0 0 0 1 1 1 1 7 0 0 0 0 0 0 1 1 1 8 0 0 0 0 0 0 0 1 1 9 0 0 0 0 0 0 0 0 1 10 0 0 0 0 0 0 0 0 0
This proof can be generalized to a very similar type of matrices, resulting in:
d e t [ m a x ( i , j ) k ] 1 ≤ i , j ≤ n = ( − 1 ) n − 1 ⋅ n k ⋅ ∏ s = 1 n − 1 ( s + 1 ) k − s k \begin{equation}
det{\bigg[ max(i,j)^k \bigg]}_{1\leq i,j \leq n} = {(-1)}^{n-1} \cdot n^{k} \cdot \prod_{s=1}^{n-1}{(s+1)^k-s^k}
\end{equation} d e t [ ma x ( i , j ) k ] 1 ≤ i , j ≤ n = ( − 1 ) n − 1 ⋅ n k ⋅ s = 1 ∏ n − 1 ( s + 1 ) k − s k
d e t [ m i n ( i , j ) k ] 1 ≤ i , j ≤ n = ∏ s = 1 n − 1 ( s + 1 ) k − s k \begin{equation}
det{\bigg[ min(i,j)^k \bigg]}_{1\leq i,j \leq n} = \prod_{s=1}^{n-1}{(s+1)^k-s^k}
\end{equation} d e t [ min ( i , j ) k ] 1 ≤ i , j ≤ n = s = 1 ∏ n − 1 ( s + 1 ) k − s k