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.

A145877 Triangle read by rows: T(n,k) is the number of permutations of [n] for which the shortest cycle length is k (1<=k<=n).

Table of values

n a(n)
1 1
2 1
3 1
4 4
5 0
6 2
7 15
8 3
9 0
10 6
11 76
12 20
13 0
14 0
15 24
16 455
17 105
18 40
19 0
20 0
21 120
22 3186
23 714
24 420
25 0
26 0
27 0
28 720
29 25487
30 5845
31 2688
32 1260
33 0
34 0
35 0
36 5040
37 229384
38 52632
39 22400
40 18144
41 0
42 0
43 0
44 0
45 40320
46 2293839
47 525105
48 223200
49 151200
50 72576
51 0
52 0
53 0
54 0
55 362880
56 25232230

List of values

[1, 1, 1, 4, 0, 2, 15, 3, 0, 6, 76, 20, 0, 0, 24, 455, 105, 40, 0, 0, 120, 3186, 714, 420, 0, 0, 0, 720, 25487, 5845, 2688, 1260, 0, 0, 0, 5040, 229384, 52632, 22400, 18144, 0, 0, 0, 0, 40320, 2293839, 525105, 223200, 151200, 72576, 0, 0, 0, 0, 362880, 25232230]