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.

A381529 T(n,k) is the number of permutations of [n] having exactly k pairs of integers i in [n] such that their cycle minima have opposite sorting order; triangle T(n,k), n>=0, 0<=k<=A125811(n)-1, read by rows.

Table of values

n a(n)
0 1
1 1
2 2
3 5
4 1
5 15
6 5
7 4
8 54
9 21
10 24
11 16
12 5
13 235
14 89
15 118
16 112
17 101
18 35
19 28
20 2
21 1237
22 408
23 577
24 633
25 719
26 585
27 402
28 239
29 167
30 59
31 14
32 7790
33 2106
34 3023
35 3529
36 4410
37 4463
38 4600
39 3012
40 2789
41 1933
42 1438
43 629
44 442
45 122
46 34
47 57581
48 12529
49 17693
50 20980
51 27208
52 30064
53 35359
54 33332
55 28137
56 24970
57 22850
58 17148
59 14272
60 8645
61 5639
62 3684
63 1809
64 664
65 282
66 34

List of values

[1, 1, 2, 5, 1, 15, 5, 4, 54, 21, 24, 16, 5, 235, 89, 118, 112, 101, 35, 28, 2, 1237, 408, 577, 633, 719, 585, 402, 239, 167, 59, 14, 7790, 2106, 3023, 3529, 4410, 4463, 4600, 3012, 2789, 1933, 1438, 629, 442, 122, 34, 57581, 12529, 17693, 20980, 27208, 30064, 35359, 33332, 28137, 24970, 22850, 17148, 14272, 8645, 5639, 3684, 1809, 664, 282, 34]