Total number of distinct solutions (modulo lcm(1,2,...,n)) of the system of congruences x == i (mod p(i)), i=1,2,...,n, where p is a permutation of order n.
A140275
Total number of distinct solutions (modulo lcm(1,2,...,n)) of the system of congruences x == i (mod p(i)), i=1,2,...,n, where p is a permutation of order n.
Terms
- a(0) =1a(1) =2a(2) =5a(3) =8a(4) =32a(5) =20a(6) =120a(7) =112a(8) =172a(9) =80a(10) =1164a(11) =312a(12) =5160a(13) =1852a(14) =812a(15) =432a(16) =10168
External references
- oeis: A140275