A259689 - cp's OEIS frontend

A259689 Irregular triangle read by rows: T(n,k) is the number of degree-n permutations without overlaps which furnish k new permutations without overlaps upon the addition of an (n+1)st element, 2 <= k <= 1 + floor(n/2).

n	a(n)
2	1
3	2
4	2
5	2
6	6
7	4
8	10
9	10
10	4
11	32
12	26
13	8
14	68
15	64
16	34
17	8
18	220
19	186
20	82
21	16
22	528
23	488
24	276
25	98
26	16
27	1724
28	1484
29	744
30	226
31	32
32	4460
33	4086
34	2382
35	980
36	258
37	32
38	14664
39	12752
40	6822
41	2498
42	578
43	64
44	39908
45	36384
46	21616
47	9576
48	3088
49	642
50	64
51	131944
52	115508
53	64264
54	26040
55	7552
56	1410
57	128

[1, 2, 2, 2, 6, 4, 10, 10, 4, 32, 26, 8, 68, 64, 34, 8, 220, 186, 82, 16, 528, 488, 276, 98, 16, 1724, 1484, 744, 226, 32, 4460, 4086, 2382, 980, 258, 32, 14664, 12752, 6822, 2498, 578, 64, 39908, 36384, 21616, 9576, 3088, 642, 64, 131944, 115508, 64264, 26040, 7552, 1410, 128]

cp's OEIS Frontend

A259689 Irregular triangle read by rows: T(n,k) is the number of degree-n permutations without overlaps which furnish k new permutations without overlaps upon the addition of an (n+1)st element, 2 <= k <= 1 + floor(n/2).

Table of values

List of values