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.

A140257 Number of permutations p of order n such that the system of congruences x == i (mod p(i)), i=1..n, is solvable.

Table of values

n a(n)
1 1
2 2
3 6
4 8
5 48
6 24
7 216
8 120
9 240
10 128
11 2544
12 336
13 11520
14 3168
15 1536
16 480
17 23616
18 2592

List of values

[1, 2, 6, 8, 48, 24, 216, 120, 240, 128, 2544, 336, 11520, 3168, 1536, 480, 23616, 2592]