A324564 - cp's OEIS frontend

A324564 Number T(n,k) of permutations p of [n] such that n-k is the maximum of 0 and the number of elements in any integer interval [p(i)..i+n*[i triangle T(n,k), n>=0, 0<=k<=n, read by rows.

n	a(n)
0	1
1	1
2	0
3	1
4	1
5	0
6	4
7	1
8	1
9	0
10	15
11	7
12	1
13	1
14	0
15	76
16	31
17	11
18	1
19	1
20	0
21	455
22	185
23	60
24	18
25	1
26	1
27	0
28	3186
29	1275
30	435
31	113
32	29
33	1
34	1
35	0
36	25487
37	10095
38	3473
39	1001
40	215
41	47
42	1
43	1
44	0
45	229384
46	90109
47	31315
48	9289
49	2299
50	406
51	76
52	1
53	1
54	0
55	2293839
56	895169
57	313227
58	95747
59	24610
60	5320
61	763
62	123
63	1
64	1
65	0

[1, 1, 0, 1, 1, 0, 4, 1, 1, 0, 15, 7, 1, 1, 0, 76, 31, 11, 1, 1, 0, 455, 185, 60, 18, 1, 1, 0, 3186, 1275, 435, 113, 29, 1, 1, 0, 25487, 10095, 3473, 1001, 215, 47, 1, 1, 0, 229384, 90109, 31315, 9289, 2299, 406, 76, 1, 1, 0, 2293839, 895169, 313227, 95747, 24610, 5320, 763, 123, 1, 1, 0]

cp's OEIS Frontend

A324564 Number T(n,k) of permutations p of [n] such that n-k is the maximum of 0 and the number of elements in any integer interval [p(i)..i+n*[i triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

List of values