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.

A364318 Irregular table T read by rows: T(n,k) gives for permutations of [n] = {1, 2, ..., n}, n >= 1, the number of cycles corresponding to the k-th partition of n without part 1 (in Abramowitz-Stegun order).

Table of values

n a(n)
1 0
2 1
3 2
4 6
5 3
6 24
7 20
8 120
9 90
10 40
11 15
12 720
13 504
14 420
15 210
16 5040
17 3360
18 2688
19 1260
20 1260
21 1120
22 105
23 40320
24 25920
25 20160
26 18144
27 9072
28 15120
29 2240
30 2520
31 362880
32 226800
33 172800
34 151200
35 72576
36 75600
37 120960
38 56700
39 50400
40 18900
41 25200
42 945

List of values

[0, 1, 2, 6, 3, 24, 20, 120, 90, 40, 15, 720, 504, 420, 210, 5040, 3360, 2688, 1260, 1260, 1120, 105, 40320, 25920, 20160, 18144, 9072, 15120, 2240, 2520, 362880, 226800, 172800, 151200, 72576, 75600, 120960, 56700, 50400, 18900, 25200, 945]