Number of permutations p of order n such that the system of congruences x == i (mod p(i)), i=1..n, is solvable.
A140257
Number of permutations p of order n such that the system of congruences x == i (mod p(i)), i=1..n, is solvable.
Terms
- a(0) =1a(1) =2a(2) =6a(3) =8a(4) =48a(5) =24a(6) =216a(7) =120a(8) =240a(9) =128a(10) =2544a(11) =336a(12) =11520a(13) =3168a(14) =1536a(15) =480a(16) =23616a(17) =2592
External references
- oeis: A140257