  This paper considers the following question: What is the maximum number of
$k$-cliques in an $n$-vertex graph with no $K_t$-minor? This question
generalises the extremal function for $K_t$-minors, which corresponds to the
$k=2$ case. The exact answer is given for $t\leq 9$ and all values of $k$. We
also determine the maximum total number of cliques in an $n$-vertex graph with
no $K_t$-minor for $t\leq 9$. Several observations are made about the case of
general $t$.
