Euler 01 - Hello Euler

This is my programmatic solution to challenge 1 of Project Euler. The problem description is as follows:
Find the sum of all the multiples of 3 or 5 below 1000.

My solution allows a user to select any two numbers over two and sum the numbers from 1 to 1-less-than-count which have one of the selected numbers as a divisor.

You can zoom in to see the numbers or zoom out to see the patterns of included and excluded numbers... Some are quite impressive and attractive. Enjoy.