Number of permutations f of {1,...,n} with f(n) = n and f(n-1) > f(1) such that f(1)*f(2) + ... + f(n-1)*f(n) + f(n)*f(1) == 0 (mod n^2).
A346391
Number of permutations f of {1,...,n} with f(n) = n and f(n-1) > f(1) such that f(1)*f(2) + ... + f(n-1)*f(n) + f(n)*f(1) == 0 (mod n^2).
Terms
- a(0) =0a(1) =0a(2) =0a(3) =2a(4) =17a(5) =16a(6) =209a(7) =3192a(8) =18300a(9) =88924a(10) =1180252
External references
- oeis: A346391