proposition: Lemma Stern_consecutive_1n n: Stern_consecutive 1 n.+1.
proof: Proof. have ha:Stern_consecutive 1 1 by exists 0,0. by move:(Stern_consecutive_rec n ha); rewrite muln1 addn1. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat) mathcomp(seq choice fintype order bigop ssralg) mathcomp(div ssrnum ssrint rat prime path binomial) mathcomp(tuple finset) gaia(fibm)