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.

A261765 Triangle read by rows: T(n,k) is the number of subpermutations of an n-set, whose orbits are each of size at most k with at least one orbit of size exactly k, and without fixed points. Equivalently, T(n,k) is the number of partial derangements of an n-set each of whose orbits is of size at most k with at least one orbit of size exactly k, and without fixed points.

Table of values

n a(n)
0 1
1 1
2 0
3 1
4 0
5 3
6 1
7 0
8 9
9 8
10 1
11 0
12 45
13 32
14 30
15 1
16 0
17 165
18 320
19 150
20 144
21 1
22 0
23 855
24 2240
25 1800
26 864
27 840
28 1
29 0
30 3843
31 17360
32 18900
33 12096
34 5880
35 5760
36 1
37 0
38 21819
39 146048
40 195300
41 145152
42 94080
43 46080
44 45360
45 1
46 0
47 114075
48 1256192
49 2120580
50 1959552
51 1270080
52 829440
53 408240
54 403200

List of values

[1, 1, 0, 1, 0, 3, 1, 0, 9, 8, 1, 0, 45, 32, 30, 1, 0, 165, 320, 150, 144, 1, 0, 855, 2240, 1800, 864, 840, 1, 0, 3843, 17360, 18900, 12096, 5880, 5760, 1, 0, 21819, 146048, 195300, 145152, 94080, 46080, 45360, 1, 0, 114075, 1256192, 2120580, 1959552, 1270080, 829440, 408240, 403200]