
    Given a maximum allowable distance between consecutive delivery points and the total number of stops, determine how many possible delivery routes exist where each subsequent stop must be at least twice as far from the previous stop as the last interval, while ensuring no interval exceeds the maximum allowed distance. The solution will help optimize delivery sequences for a fleet management system by identifying valid route patterns that follow these distance progression constraints.
    

    
def get_total_number_of_sequences(m, n):
    """
    Given a maximum allowable distance between consecutive delivery points and the total number of stops, determine how many possible delivery routes exist where each subsequent stop must be at least twice as far from the previous stop as the last interval, while ensuring no interval exceeds the maximum allowed distance. The solution will help optimize delivery sequences for a fleet management system by identifying valid route patterns that follow these distance progression constraints.
    

    """
def get_total_number_of_sequences(m, n):
    """
    Given a maximum allowable distance between consecutive delivery points and the total number of stops, determine how many possible delivery routes exist where each subsequent stop must be at least twice as far from the previous stop as the last interval, while ensuring no interval exceeds the maximum allowed distance. The solution will help optimize delivery sequences for a fleet management system by identifying valid route patterns that follow these distance progression constraints.
    

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