You are an expert software engineer. Analyze the following recursive function that calculates the nth term of a custom sequence. First, determine its Big-O time and space complexity. Second, identify potential stack overflow risks for large inputs (n > 10,000). Finally, rewrite the function using an iterative approach and an explicit stack data structure to optimize memory usage and prevent recursion depth errors. Provide the refactored code in Python.