Let $n > 4$ be an integer. A square is divided into $n^2$ smaller identical squares, in some of which were [b]1’s[/b] and in the other – [b]0's[/b]. It is not allowed in one row or column to have the following arrangements of adjacent digits in this order: $101$, $111$ or $1001$. What is the biggest number of [b]1’s[/b] in the table? (The answer depends on $n$.) 
To solve the problem, we need to determine the maximum number of **1's** that can be placed in an \( n \times n \) grid such that the patterns \( 101 \), \( 111 \), and \( 1001 \) do not appear in any row or column. 

1. **Partition the Grid**:
   Let \( n = 5k + r \), where \( k \in \mathbb{N} \) and \( r \in \{0, 1, 2, 3, 4\} \). We partition the \( n \times n \) grid into smaller grids:
   - \( 5k \times 5k \)
   - \( 5k \times r \)
   - \( r \times 5k \)
   - \( r \times r \)

2. **Maximum Number of **1's** in \( 5k \times 5k \) Grid**:
   From the referenced problem, we know that in any \( 5 \times 5 \) grid, we can place at most 10 **1's** without violating the given conditions. Therefore, in a \( 5k \times 5k \) grid, we can place at most:
   \[
   \frac{2(5k)^2}{5} = 2k(5k) = 10k^2 \text{ **1's**}
   \]

3. **Maximum Number of **1's** in \( 5k \times r \) and \( r \times 5k \) Grids**:
   Each row of length \( 5k \) can have at most \( 2k \) **1's**. Therefore, in a \( 5k \times r \) grid, we can place at most:
   \[
   r \times 2k = 2kr \text{ **1's**}
   \]
   Similarly, in a \( r \times 5k \) grid, we can place at most:
   \[
   r \times 2k = 2kr \text{ **1's**}
   \]

4. **Maximum Number of **1's** in \( r \times r \) Grid**:
   We need to consider the maximum number of **1's** that can be placed in the \( r \times r \) grid for different values of \( r \):
   - \( r = 0 \): No additional **1's**.
   - \( r = 1 \): At most 1 **1**.
   - \( r = 2 \): At most 3 **1's**.
   - \( r = 3 \): At most 5 **1's**.
   - \( r = 4 \): At most 7 **1's**.

5. **Total Maximum Number of **1's****:
   Combining all the parts, the total maximum number of **1's** in the \( n \times n \) grid is:
   \[
   10k^2 + 2kr + 2kr + \text{(maximum number of **1's** in \( r \times r \) grid)}
   \]
   Simplifying, we get:
   \[
   10k^2 + 4kr + \text{(maximum number of **1's** in \( r \times r \) grid)}
   \]

   Therefore, the maximum number of **1's** for different values of \( r \) is:
   - \( r = 0 \): \( 10k^2 \)
   - \( r = 1 \): \( 10k^2 + 4k + 1 \)
   - \( r = 2 \): \( 10k^2 + 8k + 3 \)
   - \( r = 3 \): \( 10k^2 + 12k + 5 \)
   - \( r = 4 \): \( 10k^2 + 16k + 7 \)

The final answer is \( \boxed{ 10k^2 + 4kr + \text{(maximum number of **1's** in \( r \times r } \) grid)} \).