A359413 - cp's OEIS frontend

A359413 Triangle read by rows: T(n, k) is the number of permutations of size n that require exactly k iterations of the pop-stack sorting map to reach the identity, for n >= 1, 0 <= k <= n-1.

n	a(n)
1	1
2	1
3	1
4	1
5	3
6	2
7	1
8	7
9	8
10	8
11	1
12	15
13	26
14	46
15	32
16	1
17	31
18	80
19	191
20	262
21	155
22	1
23	63
24	234
25	735
26	1440
27	1737
28	830
29	1
30	127
31	664
32	2752
33	6924
34	12314
35	12432
36	5106
37	1
38	255
39	1850
40	10114
41	31928
42	73122
43	112108
44	98156
45	35346
46	1
47	511
48	5088
49	36564
50	145199
51	404758
52	816401
53	1104042
54	844038
55	272198

[1, 1, 1, 1, 3, 2, 1, 7, 8, 8, 1, 15, 26, 46, 32, 1, 31, 80, 191, 262, 155, 1, 63, 234, 735, 1440, 1737, 830, 1, 127, 664, 2752, 6924, 12314, 12432, 5106, 1, 255, 1850, 10114, 31928, 73122, 112108, 98156, 35346, 1, 511, 5088, 36564, 145199, 404758, 816401, 1104042, 844038, 272198]

cp's OEIS Frontend

A359413 Triangle read by rows: T(n, k) is the number of permutations of size n that require exactly k iterations of the pop-stack sorting map to reach the identity, for n >= 1, 0 <= k <= n-1.

Table of values

List of values