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.

A211603 Triangular array read by rows: T(n,k) is the number of n-permutations that are pure cycles having exactly k fixed points; n>=2, 0<=k<=n-2.

Table of values

n a(n)
2 1
3 2
4 3
5 6
6 8
7 6
8 24
9 30
10 20
11 10
12 120
13 144
14 90
15 40
16 15
17 720
18 840
19 504
20 210
21 70
22 21
23 5040
24 5760
25 3360
26 1344
27 420
28 112
29 28
30 40320
31 45360
32 25920
33 10080
34 3024
35 756
36 168
37 36
38 362880
39 403200
40 226800
41 86400
42 25200
43 6048
44 1260
45 240
46 45
47 3628800
48 3991680
49 2217600
50 831600
51 237600
52 55440
53 11088
54 1980
55 330
56 55

List of values

[1, 2, 3, 6, 8, 6, 24, 30, 20, 10, 120, 144, 90, 40, 15, 720, 840, 504, 210, 70, 21, 5040, 5760, 3360, 1344, 420, 112, 28, 40320, 45360, 25920, 10080, 3024, 756, 168, 36, 362880, 403200, 226800, 86400, 25200, 6048, 1260, 240, 45, 3628800, 3991680, 2217600, 831600, 237600, 55440, 11088, 1980, 330, 55]