IMC 2004 — Keystage 3 (IWYMIC) — individual Question 6

You have sufficiently many $2\times5$ and $1\times3$ rectangles. How many integer pairs $(m,n)$, with $2\le n\le m$, give an $m\times n$ rectangle that cannot be tiled without overlap?