I think adding 1 is nicer than substracting n
sumOfDivisors added 2 twice as divisor of 4
solved euler 23 in haskell