
    Given a maximum transaction limit of m dollars and a monitoring window of n consecutive transactions, determine how many different sequences of increasing transaction amounts are possible where each transaction must be at least double the previous amount but cannot exceed the bank's limit m.
    

    
def get_total_number_of_sequences(m, n):
    """
    Given a maximum transaction limit of m dollars and a monitoring window of n consecutive transactions, determine how many different sequences of increasing transaction amounts are possible where each transaction must be at least double the previous amount but cannot exceed the bank's limit m.
    

    """
def get_total_number_of_sequences(m, n):
    """
    Given a maximum transaction limit of m dollars and a monitoring window of n consecutive transactions, determine how many different sequences of increasing transaction amounts are possible where each transaction must be at least double the previous amount but cannot exceed the bank's limit 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]