
    Given a maximum budget limit for vehicle repairs and a specified number of maintenance cycles, determine how many different maintenance cost schedules can be planned where each subsequent repair must cost at least double the previous repair while staying within the budget limit. Each repair cost must be a positive integer amount in dollars, and the schedule must account for increasingly complex repairs over the specified number of maintenance cycles.
    

    
def get_total_number_of_sequences(m, n):
    """
    Given a maximum budget limit for vehicle repairs and a specified number of maintenance cycles, determine how many different maintenance cost schedules can be planned where each subsequent repair must cost at least double the previous repair while staying within the budget limit. Each repair cost must be a positive integer amount in dollars, and the schedule must account for increasingly complex repairs over the specified number of maintenance cycles.
    

    """
def get_total_number_of_sequences(m, n):
    """
    Given a maximum budget limit for vehicle repairs and a specified number of maintenance cycles, determine how many different maintenance cost schedules can be planned where each subsequent repair must cost at least double the previous repair while staying within the budget limit. Each repair cost must be a positive integer amount in dollars, and the schedule must account for increasingly complex repairs over the specified number of maintenance cycles.
    

    """
    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]