A four-tuple of elements, (x1,x2,x3,x4), from a finite group, G, is said to be
rewriteable (see [l], , ) by p where p is an element of the symmetric group on four symbols, if
x1x2x3x4 = xp(l)xp(2)xp(3)xp(4)
The entry at the intersection of the G-th row and j-th column of each table on the succeeding three pages is the number of four-tuples from G which are rewriteable by exactly j permutations in the symmetric group on four symbols. This data was generated using the computer algebra systen CAYLEY by participants in Rose-Hulman's National Science Foundation Research Experiences for Undergra.duates program during the summer of 1991.
Kineke, Sharon A., "Data on Four-Rewriteability in Finite Groups" (1992). Mathematical Sciences Technical Reports (MSTR). 130.