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.

A370527 Triangle read by rows: T(n,k) = number of permutations of [n] having exactly one adjacent k-cycle. (n>=1, 1<=k<=n).

Table of values

n a(n)
1 1
2 0
3 1
4 3
5 2
6 1
7 8
8 4
9 2
10 1
11 45
12 18
13 6
14 2
15 1
16 264
17 99
18 22
19 6
20 2
21 1
22 1855
23 612
24 114
25 24
26 6
27 2
28 1
29 14832
30 4376
31 696
32 118
33 24
34 6
35 2
36 1
37 133497
38 35620
39 4923
40 714
41 120
42 24
43 6
44 2
45 1
46 1334960
47 324965
48 39612
49 5016
50 718
51 120
52 24
53 6
54 2
55 1
56 14684571
57 3285270
58 357900
59 40200
60 5034
61 720
62 120
63 24
64 6
65 2
66 1

List of values

[1, 0, 1, 3, 2, 1, 8, 4, 2, 1, 45, 18, 6, 2, 1, 264, 99, 22, 6, 2, 1, 1855, 612, 114, 24, 6, 2, 1, 14832, 4376, 696, 118, 24, 6, 2, 1, 133497, 35620, 4923, 714, 120, 24, 6, 2, 1, 1334960, 324965, 39612, 5016, 718, 120, 24, 6, 2, 1, 14684571, 3285270, 357900, 40200, 5034, 720, 120, 24, 6, 2, 1]