The four-way intersection problem for Latin squares

For μ. given Latin squares of order n, they have k intersection when they have k identical cells and n - k cells with mutually different entries. For each n u003e 1 the set of integers k such that there exist fJ. Latin squares of order n with k intersection is denoted by I(n). In a paper by P. Adams et al. (2002), I[n] is determined completely. In this paper we completely determine I[n] for n u003e 16. For n u003c 16, we find out most of the elements of I[n].