proposition: Lemma sternD_1n_kl n q i: i <= 2^q -> nth 0 (sternD 1 n q) i = stern (2 ^ q - i) + n * stern i.
proof: Proof. by move => h; rewrite sternD_stern // mul1n. 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)