login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
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

Table of n, a(n) for n=1..17.

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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 29 16:39 EST 2022. Contains 358431 sequences. (Running on oeis4.)