Define a sequence of polynomials Fn(x) by F0(x)=0,F1(x)=x−1 , and for n≥1 , Fn+1(x)=2xFn For each n , Fn(x) can be written in the form Fn(x)=cnP where cn is a constant and P1(x),P2(x)⋯,P are non-constant polynomials with integer coefficients and g(n) is as large as possible. For all 2<n<101 , let t be the minimum possible value of g(n) in the above expression; for how many k in the specified range is g(k)=t ?