Logic Building/Phase 3 - Level 3: Pattern Recursion/Program

Sum Series with Steps Recursively

Calculate sum of series with steps recursively.

Logic BuildingAdvanced

Logic Building

def sum_series(n, step=1):
    # Base case
    if n <= 0:
        return 0
    
    # Recursive case
    return n + sum_series(n - step, step)

# Test
n = int(input("Enter n: "))
step = int(input("Enter step: "))
result = sum_series(n, step)
print(f"Sum: {result}")

Output

Enter n: 10
Enter step: 2
Sum: 30

Sum numbers with given step size.

Key Concepts:

Base case: n <= 0, return 0
Add current number
Recurse with n - step
Creates series with step

Increasing + Decreasing in One Function

Character Patterns Recursively