Let Rn be the number of reduced Latin squares of order n. We show that Rn+1=zn=-2 mod n for prime n and Rn+1=zn=0 mod n for composite n. We provide a congruence for zn which we use to compute zn mod 3 for all n≤60. Moreover, if n≥5 and n≠1 mod 3 then zn=0 mod 3 and if n=2×3k+1 is prime, then zn=1 mod 3.
If κ is d-compound for all divisors d of n, then κ is called compatible. If there is some integer polynomial f for which κ(i)=f(i) mod n for all i, then κ is called a polynomial orthomorphism. Let λn and πn be the number of canonical compatible and canonical polynomial orthomorphisms, respectively. We find a formula for λn and show that λn=πn if and only if n=3a3 5a5 p1 p2...pr for distinct primes pi≥7 and a3≤3, a5≤2. Finally we find some new sufficient conditions for when a partial orthomorphism can be completed to an orthomorphism.