In progress solution to euler problem 351

euler351.py

#!/usr/bin/env python

def number_of_occlusions(N):

    all_points = [x+1 for x in range(N)]
    occluded_points = [0 for x in range(N)]
    number_of_occlusions = 0

    for i in range(1,N/2+1):
        delta = i
        j = i + delta

        while j < N:
            all_points[j] -= all_points[i]
            occluded_points[j] += all_points[i]
            number_of_occlusions += all_points[i]
            j = j + delta
    print(occluded_points)
    return number_of_occlusions

def calculate(rings):
   ''' Calculates problem https://projecteuler.net/problem=351 '''
   return( 6 * (number_of_occlusions(rings)) )

for h in [5, 10, 1000]:
   print(calculate(h))