A318354 - cp's OEIS frontend

A318354 Triangle read by rows: T(n,k) is the number of permutations p of {1..n} such that p(1)=k and p(i+1) < p(i) iff a strict majority of {1..n} \ {p(1)..p(i)} are < p(i).

n	a(n)
1	1
2	1
3	1
4	2
5	1
6	2
7	5
8	3
9	3
10	5
11	16
12	11
13	8
14	11
15	16
16	62
17	46
18	35
19	35
20	46
21	62
22	286
23	224
24	178
25	143
26	178
27	224
28	286
29	1519
30	1233
31	1009
32	831
33	831
34	1009
35	1233
36	1519
37	9184
38	7665
39	6432
40	5423
41	4592
42	5423
43	6432
44	7665
45	9184
46	62000
47	52816
48	45151
49	38719
50	33296
51	33296
52	38719
53	45151
54	52816
55	62000

[1, 1, 1, 2, 1, 2, 5, 3, 3, 5, 16, 11, 8, 11, 16, 62, 46, 35, 35, 46, 62, 286, 224, 178, 143, 178, 224, 286, 1519, 1233, 1009, 831, 831, 1009, 1233, 1519, 9184, 7665, 6432, 5423, 4592, 5423, 6432, 7665, 9184, 62000, 52816, 45151, 38719, 33296, 33296, 38719, 45151, 52816, 62000]

cp's OEIS Frontend

A318354 Triangle read by rows: T(n,k) is the number of permutations p of {1..n} such that p(1)=k and p(i+1) < p(i) iff a strict majority of {1..n} \ {p(1)..p(i)} are < p(i).

Table of values

List of values