Marinada '26

[lang=hr] Neka su $m$ i $n$ prirodni brojevi, $m\le50$, $n\le50$. Koliko postoji $m \times n$ ploča koje je moguće popločati $1 \times 6$ dominama. Domine se mogu rotirati. Napomena: ploče $2 \times 3$ i $3 \times 2$ broje se kao dvije različite ploče. [/lang] [lang=en] Let $m$, $n$ be positive integers, $m\le50$, $n\le50$. How many $m \times n$ boards are there that can be tiled with $1 \times 6$ dominoes. Dominoes can be rotated. Reminder: boards $2 \times 3$ and $3 \times 2$ are considered to be two different boards. [/lang]