code: def consecutiveness(password, consecutive_length=3):
          
          consec = 0
          for i in range(len(password) - consecutive_length):
              if all([char.islower() for char in password[i:i+consecutive_length]]):
                  consec += 1
              elif all([char.islower() for char in password[i:i+consecutive_length]]):
                  consec += 1
  
          try:
              return consec / (len(password) - consecutive_length)
          except ZeroDivisionError:
              return 0
docs: Consecutiveness is the enemy of entropy, but makes it easier to remember.
          :param str password:
          :param int consecutive_length: length of the segment to be uniform to consider loss of entropy
          :param int base_length: usual length of the password
          :return int: in range 0-1
          >>> Complexity.consecutiveness('password')
          1.0
          >>> Complexity.consecutiveness('PaSsWoRd')
          0.0
          >>> Complexity.consecutiveness('yio')
          0