
    Determine how many different traffic flow patterns are possible across n consecutive time intervals at an urban intersection, where the flow rate in each interval must be at least double the previous interval's rate and cannot exceed the maximum safe capacity of m vehicles per minute. The traffic engineering team needs this analysis to optimize signal timing while ensuring safety and preventing congestion.
    

    
def get_total_number_of_sequences(m, n):
    """
    Determine how many different traffic flow patterns are possible across n consecutive time intervals at an urban intersection, where the flow rate in each interval must be at least double the previous interval's rate and cannot exceed the maximum safe capacity of m vehicles per minute. The traffic engineering team needs this analysis to optimize signal timing while ensuring safety and preventing congestion.
    

    """
def get_total_number_of_sequences(m, n):
    """
    Determine how many different traffic flow patterns are possible across n consecutive time intervals at an urban intersection, where the flow rate in each interval must be at least double the previous interval's rate and cannot exceed the maximum safe capacity of m vehicles per minute. The traffic engineering team needs this analysis to optimize signal timing while ensuring safety and preventing congestion.
    

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