Project Euler 174 - Counting the number of "hollow" square laminae that can form one, two, three, ... distinct arrangements

Official link:

Thought Process

Used almost exactly the same code as for problem 173.

Used Counter from the collections module to quickly make my list into a dictionary containing the type of each number, then I just went through the dictionary and if the type was between 1 and 10 then I add it to a count and we are done.

Interactive Code

Enter a number (yourinput)

Code will output sum of N(n) from n = 1 to 10, where t ≤ yourinput