For a given odd integer n, generate a matrix as follows:
Input: n = 5; Output:
[ 2 1 0 0 0 1 1 1 0 0 0 1 0 1 0 0 0 1 1 1 0 0 0 1 2 ]
Input: n=7; Output:
[ 3 1 0 0 0 0 0 1 2 1 0 0 0 0 0 1 1 1 0 0 0 0 0 1 0 1 0 0 0 0 0 1 1 1 0 0 0 0 0 1 2 1 0 0 0 0 0 1 3 ]
For further understanding of the pattern, please check the test suite.
A good history lesson!
Project Euler: Problem 5, Smallest multiple
241 Solvers
Back to basics 23 - Triangular matrix
532 Solvers
Matrix with different incremental runs
194 Solvers
357 Solvers
Back to basics - mean of corner elements of a matrix
237 Solvers