|
Search: id:A140275
|
|
|
| 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. |
|
+0
1
|
|
| 1, 2, 5, 8, 32, 20, 120, 112, 172, 80, 1164, 312, 5160, 1852, 812, 432, 10168
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
The system of congruences x == i (mod p(i)) has the same solution as the system of congruences x == n-1-i (mod p'(i)) where p'=(p(n),p(n-1),...,p(1)). Therefore this sequence also gives the number of distinct solutions to the system of congruences x == -i (mod p(i)), i=1,2,...,n.
|
|
CROSSREFS
|
Cf. A003418, A140257.
Sequence in context: A093365 A128600 A066846 this_sequence A025533 A086809 A153863
Adjacent sequences: A140272 A140273 A140274 this_sequence A140276 A140277 A140278
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Max Alekseyev (maxale(AT)gmail.com), May 16 2008
|
|
|
Search completed in 0.002 seconds
|
