<Dl> <Dd> f i = n i N = n i ∑ j n j . (\ displaystyle f_ (i) = (\ frac (n_ (i)) (N)) = (\ frac (n_ (i)) (\ sum _ (j) n_ (j))).) </Dd> </Dl> <Dd> f i = n i N = n i ∑ j n j . (\ displaystyle f_ (i) = (\ frac (n_ (i)) (N)) = (\ frac (n_ (i)) (\ sum _ (j) n_ (j))).) </Dd> <P> The values of f i (\ displaystyle f_ (i)) for all events i (\ displaystyle i) can be plotted to produce a frequency distribution . </P> <P> In the case when n i = 0 (\ displaystyle n_ (i) = 0) for certain i, pseudocounts can be added . </P>

The value which occurs highest number of times in a series is called