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.

A184184 Triangle read by rows: T(n,k) is the number of permutations of [n] having k adjacent cycles (0 <= k <= n). An adjacent cycle is a cycle of the form (i, i+1, i+2, ...) (including 1-element cycles).

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 1
6 1
7 2
8 2
9 1
10 6
11 8
12 6
13 3
14 1
15 34
16 42
17 27
18 12
19 4
20 1
21 216
22 258
23 156
24 64
25 20
26 5
27 1
28 1566
29 1824
30 1068
31 420
32 125
33 30
34 6
35 1
36 12840
37 14664
38 8400
39 3220
40 930
41 216
42 42
43 7
44 1
45 117696
46 132360
47 74580
48 28080
49 7950
50 1806
51 343
52 56
53 8
54 1
55 1193760
56 1326120
57 737640
58 273960
59 76440
60 17094
61 3192
62 512
63 72
64 9
65 1

List of values

[1, 0, 1, 0, 1, 1, 1, 2, 2, 1, 6, 8, 6, 3, 1, 34, 42, 27, 12, 4, 1, 216, 258, 156, 64, 20, 5, 1, 1566, 1824, 1068, 420, 125, 30, 6, 1, 12840, 14664, 8400, 3220, 930, 216, 42, 7, 1, 117696, 132360, 74580, 28080, 7950, 1806, 343, 56, 8, 1, 1193760, 1326120, 737640, 273960, 76440, 17094, 3192, 512, 72, 9, 1]