cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

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.

Original entry on oeis.org

1, 2, 5, 8, 32, 20, 120, 112, 172, 80, 1164, 312, 5160, 1852, 812, 432, 10168
Offset: 1

Views

Author

Max Alekseyev, May 16 2008

Keywords

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).

Crossrefs

Cf. A003418, A138588, A140257.
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.