
    Calculate the number of possible passenger load patterns across n consecutive bus stops, where the passenger count at each stop must be at least double the previous stop's count and cannot exceed the maximum bus capacity m, to identify viable load distribution scenarios for route optimization. The initial passenger count at the first stop can be any positive number up to m.
    

    
def get_total_number_of_sequences(m, n):
    """
    Calculate the number of possible passenger load patterns across n consecutive bus stops, where the passenger count at each stop must be at least double the previous stop's count and cannot exceed the maximum bus capacity m, to identify viable load distribution scenarios for route optimization. The initial passenger count at the first stop can be any positive number up to m.
    

    """
def get_total_number_of_sequences(m, n):
    """
    Calculate the number of possible passenger load patterns across n consecutive bus stops, where the passenger count at each stop must be at least double the previous stop's count and cannot exceed the maximum bus capacity m, to identify viable load distribution scenarios for route optimization. The initial passenger count at the first stop can be any positive number up to 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]