A335009 - cp's OEIS frontend

A335009 Irregular triangle read by rows: T(n,k) is the number of permutations of two copies of 1..n with the sum of the distances between equal numbers having total value n + 2k, 0 <= k <= n(n-1)/2.

n	a(n)
1	1
2	2
3	4
4	6
5	24
6	24
7	36
8	24
9	144
10	288
11	480
12	576
13	432
14	576
15	120
16	960
17	2880
18	6000
19	10560
20	12960
21	18720
22	18000
23	17280
24	11520
25	14400
26	720
27	7200
28	28800
29	74880
30	161280
31	269280
32	423360
33	596160
34	725760
35	876960
36	915840
37	967680
38	794880
39	691200
40	432000
41	518400

[1, 2, 4, 6, 24, 24, 36, 24, 144, 288, 480, 576, 432, 576, 120, 960, 2880, 6000, 10560, 12960, 18720, 18000, 17280, 11520, 14400, 720, 7200, 28800, 74880, 161280, 269280, 423360, 596160, 725760, 876960, 915840, 967680, 794880, 691200, 432000, 518400]

cp's OEIS Frontend

A335009 Irregular triangle read by rows: T(n,k) is the number of permutations of two copies of 1..n with the sum of the distances between equal numbers having total value n + 2k, 0 <= k <= n(n-1)/2.

Table of values

List of values

cp's OEIS Frontend

A335009 Irregular triangle read by rows: T(n,k) is the number of permutations of two copies of 1..n with the sum of the distances between equal numbers having total value n + 2*k, 0 <= k <= n*(n-1)/2.

Table of values

List of values

A335009 Irregular triangle read by rows: T(n,k) is the number of permutations of two copies of 1..n with the sum of the distances between equal numbers having total value n + 2k, 0 <= k <= n(n-1)/2.