"anti-bingo"

permutations.py

import numpy as np
from itertools import permutations

def count_permutation_matrices(n):
    count = 0

    row_permutations = permutations(range(n))

    permutation_matrices = []
    for perm in row_permutations:
        matrix = np.zeros((n, n), dtype=int)
        for row, col in enumerate(perm):
            matrix[row, col] = 1

        if not any(matrix[i, i] == 1 for i in range(n)):
            continue

        if not any(matrix[i, n - 1 - i] == 1 for i in range(n)):
            continue

        count += 1

    return count

n = 1
while True:
    print(count_permutation_matrices(n))
    n += 1