
    Design a fraud detection algorithm that identifies suspicious credit card spending patterns by finding the total number of possible transaction sequences where each subsequent charge is at least double the previous amount, with sequences being n transactions long and no single transaction exceeding m dollars.
    

    
def get_total_number_of_sequences(m, n):
    """
    Design a fraud detection algorithm that identifies suspicious credit card spending patterns by finding the total number of possible transaction sequences where each subsequent charge is at least double the previous amount, with sequences being n transactions long and no single transaction exceeding m dollars.
    

    """
def get_total_number_of_sequences(m, n):
    """
    Design a fraud detection algorithm that identifies suspicious credit card spending patterns by finding the total number of possible transaction sequences where each subsequent charge is at least double the previous amount, with sequences being n transactions long and no single transaction exceeding m dollars.
    

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