Figures for highest number of identical objects in the
selection when n objects are selected from t equiprobable 
objects selecting with replacement.  E.g. if n = 8 and
there are 80 equipossible choices on each of the five
selections, say one object was selected three times,
another twice, another twice and three other objects
were selected once each then the score is 3.  Calculations
done by brute force simulation in Perl.  
(V. bad) programming by Chris Evans (C.Evans@sghms.ac.uk).
I would love someone to improve the programming and/or 
put me onto analytical solutions for this problem.

n = 3, t = 28

Final score:
 score         n            proportion
------   ------------     ------------
     1          19656      0.895408163
     2           2268      0.103316327
     3             28      0.001275510




... and for scoring at or above cutting score

   cut
 score         n            proportion
------   ------------     ------------
     3             28      0.001275510
     2           2296      0.104591837
     1          21952      1.000000000

O.K. total = 21952 = expected total = 21952