```python
def get_max_sum(n):
    """
    Finds the maximum sum possible using the equation
    f(n) = max((f(n/2) + f(n/3) + f(n/4) + f(n/5)), n).
    This implementation uses recursion with memoization to avoid recomputing
    results for the same number.
    """
    memo = {}

    def solve(num):
        if num == 0:
            return 0

        if num in memo:
            return memo[num]

        # Recursively calculate the sum of the function applied to the divisions.
        sum_of_parts = (
            solve(num // 2) +
            solve(num // 3) +
            solve(num // 4) +
            solve(num // 5)
        )

        # The value is the maximum of the number itself or the calculated sum.
        result = max(num, sum_of_parts)

        # Store the result in the memoization dictionary for future use.
        memo[num] = result
        return result

    return solve(n)

```