Linear complexity and k-error linear complexity of the stream cipher are two important standards to scale the randomicity of keystreams. For the 2n-periodic periodic binary sequence with linear complexity 2n − 1 and k = 2,3, the number of sequences with given k-error linear complexity and the expected k-error linear complexity are provided. Moreover, the proportion of the sequences whose k-error linear complexity is bigger than the expected value is analyzed.