Achromatic number of K5×Kn for large n

Achromatic number of a graph G is a maximum number of colours in a proper vertex colouring of G such that vertices of any two distinct colour classes are joined by at least one edge. We determine the achromatic number of the Cartesian product of K5 and Kn for all n⩾25.