
    Given a bank's maximum transaction limit of m dollars and a sequence of n consecutive transactions, determine the number of possible transaction patterns where each subsequent transaction amount is at least double the previous amount while staying within the bank's limit m. This pattern analysis helps identify potential fraudulent behavior where transaction amounts escalate rapidly in a suspicious manner.
    

    
def get_total_number_of_sequences(m, n):
    """
    Given a bank's maximum transaction limit of m dollars and a sequence of n consecutive transactions, determine the number of possible transaction patterns where each subsequent transaction amount is at least double the previous amount while staying within the bank's limit m. This pattern analysis helps identify potential fraudulent behavior where transaction amounts escalate rapidly in a suspicious manner.
    

    """
def get_total_number_of_sequences(m, n):
    """
    Given a bank's maximum transaction limit of m dollars and a sequence of n consecutive transactions, determine the number of possible transaction patterns where each subsequent transaction amount is at least double the previous amount while staying within the bank's limit m. This pattern analysis helps identify potential fraudulent behavior where transaction amounts escalate rapidly in a suspicious manner.
    

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