|
EXAMPLE
|
Triangle starts:
[ 0] 0;
[ 1] 1, 1;
[ 2] -1, -1, 1;
[ 3] 0, -1, -1, 1;
[ 4] 1, 1, 1, 1, 1;
[ 5] -1, 0, -1, 1, -1, -1;
[ 6] 0, 1, -1, -1, -1, -1, 1;
[ 7] 1, -1, 0, -1, -1, -1, 1, -1;
[ 8] -1, -1, 1, -1, -1, 1, -1, 1, -1;
[ 9] 0, 1, 1, 1, 1, 1, 1, 1, 1, 1;
[10] 1, 0, -1, -1, 1, -1, -1, -1, -1, 1, 1;
.
Not limiting the range of k leads to the square array:
.
[n\p] 3, 5, 7, 11, 13, 17, 19, 23, 29, 31
-----------------------------------------------
[0] 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...
[1] 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...
[2] -1, -1, 1, -1, -1, 1, -1, 1, -1, 1, ...
[3] 0, -1, -1, 1, 1, -1, -1, 1, -1, -1, ...
[4] 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...
[5] -1, 0, -1, 1, -1, -1, 1, -1, 1, 1, ...
[6] 0, 1, -1, -1, -1, -1, 1, 1, 1, -1, ...
[7] 1, -1, 0, -1, -1, -1, 1, -1, 1, 1, ...
[8] -1, -1, 1, -1, -1, 1, -1, 1, -1, 1, ...
[9] 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...
...
|