A357329 - cp's OEIS frontend

A357329 Triangular array read by rows: T(n, k) = number of occurrences of 2k as a sum |1 - p(1)| + |2 - p(2)| + ... + |n - p(n)|, where (p(1), p(2), ..., p(n)) ranges through the permutations of (1,2,...,n), for n >= 1, 0 <= k <= n-1.

n	a(n)
1	1
2	1
3	1
4	1
5	2
6	3
7	1
8	3
9	7
10	9
11	1
12	4
13	12
14	24
15	35
16	1
17	5
18	18
19	46
20	93
21	137
22	1
23	6
24	25
25	76
26	187
27	366
28	591
29	1
30	7
31	33
32	115
33	327
34	765
35	1523
36	2553
37	1
38	8
39	42
40	164
41	524
42	1400
43	3226
44	6436
45	11323
46	1
47	9
48	52
49	224
50	790
51	2350
52	6072
53	13768
54	27821
55	50461
56	1
57	10
58	63
59	296
60	1138
61	3708
62	10538
63	26480
64	59673
65	121626
66	226787

[1, 1, 1, 1, 2, 3, 1, 3, 7, 9, 1, 4, 12, 24, 35, 1, 5, 18, 46, 93, 137, 1, 6, 25, 76, 187, 366, 591, 1, 7, 33, 115, 327, 765, 1523, 2553, 1, 8, 42, 164, 524, 1400, 3226, 6436, 11323, 1, 9, 52, 224, 790, 2350, 6072, 13768, 27821, 50461, 1, 10, 63, 296, 1138, 3708, 10538, 26480, 59673, 121626, 226787]

cp's OEIS Frontend

A357329 Triangular array read by rows: T(n, k) = number of occurrences of 2k as a sum |1 - p(1)| + |2 - p(2)| + ... + |n - p(n)|, where (p(1), p(2), ..., p(n)) ranges through the permutations of (1,2,...,n), for n >= 1, 0 <= k <= n-1.

Table of values

List of values