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.

A261762 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, 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.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 4
6 1
7 1
8 10
9 18
10 1
11 1
12 46
13 78
14 108
15 1
16 1
17 166
18 486
19 636
20 780
21 1
22 1
23 856
24 3096
25 4896
26 5760
27 6600
28 1
29 1
30 3844
31 21204
32 40104
33 52200
34 58080
35 63840
36 1
37 1
38 21820
39 167868
40 363168
41 508320
42 602400
43 648480
44 693840
45 1
46 1
47 114076
48 1370268
49 3490848
50 5450400
51 6720480

List of values

[1, 1, 1, 1, 1, 4, 1, 1, 10, 18, 1, 1, 46, 78, 108, 1, 1, 166, 486, 636, 780, 1, 1, 856, 3096, 4896, 5760, 6600, 1, 1, 3844, 21204, 40104, 52200, 58080, 63840, 1, 1, 21820, 167868, 363168, 508320, 602400, 648480, 693840, 1, 1, 114076, 1370268, 3490848, 5450400, 6720480]