Parsimonious games are a subset of constant sum homogeneous weighted majority games unequivocally described by their free type representation vector. We show that the minimal winning quota of parsimonious games satisfies a second order, linear, homogeneous, finite difference equation with nonconstant coefficients except for uniform games. We provide the solution of such an equation which may be thought as the generalized version of the polynomial expansion of a proper k-Fibonacci sequence. In addition we show that the minimal winning quota is a symmetric function of the representation vector; exploiting this property it is straightforward to prove that twin Parsimonious games, i.e. a couple of games whose free type representations are each other symmetric, share the same minimal winning quota.
