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.

A348075 Triangular array read by rows: T(n,k) is the number of derangements whose shortest cycle has exactly k nodes; n >= 1, 1 <= k <= n.

Table of values

n a(n)
1 0
2 0
3 1
4 0
5 0
6 2
7 0
8 3
9 0
10 6
11 0
12 20
13 0
14 0
15 24
16 0
17 105
18 40
19 0
20 0
21 120
22 0
23 714
24 420
25 0
26 0
27 0
28 720
29 0
30 5845
31 2688
32 1260
33 0
34 0
35 0
36 5040
37 0
38 52632
39 22400
40 18144
41 0
42 0
43 0
44 0
45 40320
46 0
47 525105
48 223200
49 151200
50 72576
51 0
52 0
53 0
54 0
55 362880
56 0
57 5777090
58 2522520
59 1425600
60 1330560
61 0
62 0
63 0
64 0
65 0
66 3628800

List of values

[0, 0, 1, 0, 0, 2, 0, 3, 0, 6, 0, 20, 0, 0, 24, 0, 105, 40, 0, 0, 120, 0, 714, 420, 0, 0, 0, 720, 0, 5845, 2688, 1260, 0, 0, 0, 5040, 0, 52632, 22400, 18144, 0, 0, 0, 0, 40320, 0, 525105, 223200, 151200, 72576, 0, 0, 0, 0, 362880, 0, 5777090, 2522520, 1425600, 1330560, 0, 0, 0, 0, 0, 3628800]