
    Design a security verification system for a banking mobile app that determines the number of possible authentication strength combinations across n verification steps, where each subsequent verification level must be at least twice as strong as the previous level and no verification strength can exceed the maximum security threshold m. The authentication strength is measured in complexity units, and each verification step must use a positive integer value of complexity units.
    

    
def get_total_number_of_sequences(m, n):
    """
    Design a security verification system for a banking mobile app that determines the number of possible authentication strength combinations across n verification steps, where each subsequent verification level must be at least twice as strong as the previous level and no verification strength can exceed the maximum security threshold m. The authentication strength is measured in complexity units, and each verification step must use a positive integer value of complexity units.
    

    """
def get_total_number_of_sequences(m, n):
    """
    Design a security verification system for a banking mobile app that determines the number of possible authentication strength combinations across n verification steps, where each subsequent verification level must be at least twice as strong as the previous level and no verification strength can exceed the maximum security threshold m. The authentication strength is measured in complexity units, and each verification step must use a positive integer value of complexity units.
    

    """
    T = [[0 for i in range(n + 1)] for i in range(m + 1)]
    for i in range(m + 1):
        for j in range(n + 1):
            if i == 0 or j == 0:
                T[i][j] = 0
            elif i < j:
                T[i][j] = 0
            elif j == 1:
                T[i][j] = i
            else:
                T[i][j] = T[i - 1][j] + T[i // 2][j - 1]
    return T[m][n]