Thanks Carl & Markiyan. Ever so grateful for these. They've have worked perfectly.

Kind regards,

Weirp

@Carl Love 

This procedure works perfectly. Your help on this, and the previous inquiry, is really appreciated Carl. Thanks.

@Carl Love 

They'll take on values of -1, 0 or 1.

@Carl Love 

Both i and j start at 1, and their upper bounds are both k+1. I.e. the kth matrix has the dimensions (k+1) x (k+1). One of the problems I can see with the above recursion is that the right hand side will attempt to access an i=0, j=0 or both i and j =0 entry. In that case, the entry should be interpreted as being zero.

Thanks.

@Adri van der Meer 

Many thanks for your assistance.

For the benefit of others copying this procedure, I should point out that the multivariable function needs to be expressed as such in the procedure. Above where I had put f(x) = 0 it should have read f(x,y) = 0.

Thanks again and best regards.

@Carl Love

Many thanks for taking the time to address this for me Carl.