proposition: Lemma SternD_positive' n k: 0 < k < 2^n -> 1 < nth 0 (stern11 n) k.
proof: Proof. move => h; exact: (sternD_ge_in_bounds 1 1 h). 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)