Let GL3(Zn) denote the set of 3 × 3 invertible matrices with entries from Zn, the ring of integers modulo n. We study the distribution of a matrix function called the permanent, restricting its domain to GL3(Zn). Given x ∈ Z, we count the number of elements in the set G3(n, x) = {M ∈ GL3(Zn) | perm(M) ≡ x (mod n)}. © 2022, Colgate University. All rights reserved.