
    Given a bus route with n consecutive stops and a maximum passenger capacity of m, determine the number of possible passenger load patterns where at each stop the number of passengers must be at least double the previous stop's count while not exceeding the bus's maximum capacity m.
    

    
def get_total_number_of_sequences(m, n):
    """
    Given a bus route with n consecutive stops and a maximum passenger capacity of m, determine the number of possible passenger load patterns where at each stop the number of passengers must be at least double the previous stop's count while not exceeding the bus's maximum capacity m.
    

    """
def get_total_number_of_sequences(m, n):
    """
    Given a bus route with n consecutive stops and a maximum passenger capacity of m, determine the number of possible passenger load patterns where at each stop the number of passengers must be at least double the previous stop's count while not exceeding the bus's maximum capacity m.
    

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