
    Design a function for a social event recommendation system that determines the number of possible event sequences that can be scheduled, where each event must have at least double the attendance of the previous one. Given a maximum venue capacity of m participants and a requirement to schedule n consecutive events, calculate how many valid sequences of growing events can be planned while ensuring no event exceeds the venue limit.
    

    
def get_total_number_of_sequences(m, n):
    """
    Design a function for a social event recommendation system that determines the number of possible event sequences that can be scheduled, where each event must have at least double the attendance of the previous one. Given a maximum venue capacity of m participants and a requirement to schedule n consecutive events, calculate how many valid sequences of growing events can be planned while ensuring no event exceeds the venue limit.
    

    """
def get_total_number_of_sequences(m, n):
    """
    Design a function for a social event recommendation system that determines the number of possible event sequences that can be scheduled, where each event must have at least double the attendance of the previous one. Given a maximum venue capacity of m participants and a requirement to schedule n consecutive events, calculate how many valid sequences of growing events can be planned while ensuring no event exceeds the venue limit.
    

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