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.

A206703 Triangular array read by rows. T(n,k) is the number of partial permutations (injective partial functions) of {1,2,...,n} that have exactly k elements in a cycle. The k elements are not necessarily in the same cycle. A fixed point is considered to be in a cycle.

Table of values

n a(n)
0 1
1 1
2 1
3 3
4 2
5 2
6 13
7 9
8 6
9 6
10 73
11 52
12 36
13 24
14 24
15 501
16 365
17 260
18 180
19 120
20 120
21 4051
22 3006
23 2190
24 1560
25 1080
26 720
27 720
28 37633
29 28357
30 21042
31 15330
32 10920
33 7560
34 5040
35 5040
36 394353
37 301064
38 226856
39 168336
40 122640
41 87360
42 60480
43 40320
44 40320

List of values

[1, 1, 1, 3, 2, 2, 13, 9, 6, 6, 73, 52, 36, 24, 24, 501, 365, 260, 180, 120, 120, 4051, 3006, 2190, 1560, 1080, 720, 720, 37633, 28357, 21042, 15330, 10920, 7560, 5040, 5040, 394353, 301064, 226856, 168336, 122640, 87360, 60480, 40320, 40320]