[modulus1]

Too many times I've 'solved' a Project Euler problem like this: 1. Write a program to solve the problem inefficiently. 2. Look up the sequence F(1), F(2), F(3) ... at oeis.org