The sequence $n_1<n_2<\ldots < n_k$ consists of all positive integers $n$ for which in a square $n \times n$ one can mark $10$ cells such that in any square $3 \times 3$ an odd amount of cells are marked. Find $n_{k-2}$.
Source: Belarusian National Olympiad 2021
Tags: combinatorics
The sequence $n_1<n_2<\ldots < n_k$ consists of all positive integers $n$ for which in a square $n \times n$ one can mark $10$ cells such that in any square $3 \times 3$ an odd amount of cells are marked. Find $n_{k-2}$.