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.

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.

Table of values

n a(n)
1 1
2 2
3 5
4 8
5 32
6 20
7 120
8 112
9 172
10 80
11 1164
12 312
13 5160
14 1852
15 812
16 432
17 10168

List of values

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

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

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