a(n) is the number of permutations pi in S_n such that pi(i) - i != 1 (mod n) and pi(i) - i != -1 (mod n) for all i.

A354152

a(n) is the number of permutations pi in S_n such that pi(i) - i != 1 (mod n) and pi(i) - i != -1 (mod n) for all i.

Terms

    a(0) =1a(1) =0a(2) =1a(3) =1a(4) =4a(5) =13a(6) =82a(7) =579a(8) =4740a(9) =43387a(10) =439794a(11) =4890741a(12) =59216644a(13) =775596313a(14) =10927434466a(15) =164806435783

External references