I want to eliminate the third argument in my code below which is just an empty array that I think I should be able to create as a local variable within the function itself.

As a bonus, I would also like to build this into a single function although I don't think this can be achieved with the current recursive structure of the code.

I tried creating an empty array as a local variable (See the commented out integers list)

I also tried to create a count variable to increment with each combination found (See the commented out count variable)

```
def count_combinations(number, integers_available, integers):

    coin_set = []
    # integers = []
    # count = 0

    if sum(integers) == number:
        coin_set.append(integers)
        # count += 1

    elif sum(integers) > number:
        pass

    elif integers_available == []:
        pass

    else:
        for c in count_combinations(number, integers_available[:], integers + [integers_available[0]]):
            coin_set.append(c)
            # count += 1
        for c in count_combinations(number, integers_available[1:], integers):
            coin_set.append(c)
            # count += 1

    # return count += 1
    return coin_set

def count_total(number, integers_available, integers):
    return len(count_combinations(number, integers_available, integers))

# Testing the code
number = 15
integers_available = [1, 5, 10]
print(count_total(number, integers_available, []))

```

I expect to get the same results but with fewer arguments in the function since one of the arguments will have been switched to a local variable instead.