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.

A293211 Triangle T(n,k) is the number of permutations on n elements with at least one k-cycle for 1 <= k <= n.

Table of values

n a(n)
1 1
2 1
3 1
4 4
5 3
6 2
7 15
8 9
9 8
10 6
11 76
12 45
13 40
14 30
15 24
16 455
17 285
18 200
19 180
20 144
21 120
22 3186
23 1995
24 1400
25 1260
26 1008
27 840
28 720
29 25487
30 15855
31 11200
32 8820
33 8064
34 6720
35 5760
36 5040
37 229384
38 142695
39 103040
40 79380
41 72576
42 60480
43 51840
44 45360
45 40320
46 2293839
47 1427895
48 1030400
49 793800
50 653184
51 604800
52 518400
53 453600
54 403200
55 362880

List of values

[1, 1, 1, 4, 3, 2, 15, 9, 8, 6, 76, 45, 40, 30, 24, 455, 285, 200, 180, 144, 120, 3186, 1995, 1400, 1260, 1008, 840, 720, 25487, 15855, 11200, 8820, 8064, 6720, 5760, 5040, 229384, 142695, 103040, 79380, 72576, 60480, 51840, 45360, 40320, 2293839, 1427895, 1030400, 793800, 653184, 604800, 518400, 453600, 403200, 362880]