A322481 - cp's OEIS frontend

A322481 Permutation breadth triangle: B(n,k) is the number of permutations w in S_n with breadth(w) = k, where breadth(w) = min({ |i-j|+|w(i)-w(j)| : 1 <= i < j <= n }).

n	a(n)
1	0
2	0
3	2
4	0
5	6
6	0
7	0
8	22
9	2
10	0
11	0
12	106
13	14
14	0
15	0
16	0
17	630
18	90
19	0
20	0
21	0
22	0
23	4394
24	644
25	2
26	0
27	0
28	0
29	0
30	35078
31	5222
32	20
33	0
34	0
35	0
36	0
37	0
38	315258
39	47464
40	158
41	0
42	0
43	0
44	0
45	0
46	0
47	3149494
48	477346
49	1960
50	0
51	0
52	0
53	0
54	0
55	0

[0, 0, 2, 0, 6, 0, 0, 22, 2, 0, 0, 106, 14, 0, 0, 0, 630, 90, 0, 0, 0, 0, 4394, 644, 2, 0, 0, 0, 0, 35078, 5222, 20, 0, 0, 0, 0, 0, 315258, 47464, 158, 0, 0, 0, 0, 0, 0, 3149494, 477346, 1960, 0, 0, 0, 0, 0, 0]

cp's OEIS Frontend

A322481 Permutation breadth triangle: B(n,k) is the number of permutations w in S_n with breadth(w) = k, where breadth(w) = min({ |i-j|+|w(i)-w(j)| : 1 <= i < j <= n }).

Table of values

List of values