
    Given a maximum allowable time interval between consecutive deliveries (m minutes) and the total number of delivery stops (n), determine how many possible delivery schedules exist where each subsequent delivery must occur at least twice the time after the previous delivery but no more than m minutes later.
    

    
def get_total_number_of_sequences(m, n):
    """
    Given a maximum allowable time interval between consecutive deliveries (m minutes) and the total number of delivery stops (n), determine how many possible delivery schedules exist where each subsequent delivery must occur at least twice the time after the previous delivery but no more than m minutes later.
    

    """
def get_total_number_of_sequences(m, n):
    """
    Given a maximum allowable time interval between consecutive deliveries (m minutes) and the total number of delivery stops (n), determine how many possible delivery schedules exist where each subsequent delivery must occur at least twice the time after the previous delivery but no more than m minutes later.
    

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