The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 1
 1, 2, 5, 8, 32, 20, 120, 112, 172, 80, 1164, 312, 5160, 1852, 812, 432, 10168 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS 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. a(n) <= A140257(n). LINKS CROSSREFS Cf. A003418, A138588, A140257. Sequence in context: A066846 A304043 A290594 * A025533 A295970 A086809 Adjacent sequences:  A140272 A140273 A140274 * A140276 A140277 A140278 KEYWORD nonn,more AUTHOR Max Alekseyev, May 16 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 19 09:39 EDT 2021. Contains 345126 sequences. (Running on oeis4.)