
    Given a hospital's maximum staffing capacity per shift (m) and the number of consecutive shifts to plan for (n), determine how many different staffing patterns are possible where each shift must have at least double the staff members of the previous shift to handle expected patient surges. Each shift must have at least one staff member, and no shift can exceed the maximum capacity m.
    

    
def get_total_number_of_sequences(m, n):
    """
    Given a hospital's maximum staffing capacity per shift (m) and the number of consecutive shifts to plan for (n), determine how many different staffing patterns are possible where each shift must have at least double the staff members of the previous shift to handle expected patient surges. Each shift must have at least one staff member, and no shift can exceed the maximum capacity m.
    

    """
def get_total_number_of_sequences(m, n):
    """
    Given a hospital's maximum staffing capacity per shift (m) and the number of consecutive shifts to plan for (n), determine how many different staffing patterns are possible where each shift must have at least double the staff members of the previous shift to handle expected patient surges. Each shift must have at least one staff member, and no shift can exceed the maximum capacity 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]