
    Given a maximum allowable travel time between stops and the number of delivery locations, determine how many possible delivery route sequences exist where the travel time to each subsequent stop must be at least double the time to the previous stop due to increasing traffic density, while not exceeding the maximum allowed travel time.
    

    
def get_total_number_of_sequences(m, n):
    """
    Given a maximum allowable travel time between stops and the number of delivery locations, determine how many possible delivery route sequences exist where the travel time to each subsequent stop must be at least double the time to the previous stop due to increasing traffic density, while not exceeding the maximum allowed travel time.
    

    """
def get_total_number_of_sequences(m, n):
    """
    Given a maximum allowable travel time between stops and the number of delivery locations, determine how many possible delivery route sequences exist where the travel time to each subsequent stop must be at least double the time to the previous stop due to increasing traffic density, while not exceeding the maximum allowed travel time.
    

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