proposition: Lemma stir_small n p: 'St(n, (n+p).+1) = 0.
proof: Proof. move: p; elim: n => [p // | n Hrec p]. by rewrite addSn stirS Hrec -addnS Hrec muln0. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype) mathcomp(ssrnat seq path div) mathcomp(fintype tuple finfun bigop finset binomial)