A324563 - cp's OEIS frontend

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

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

cp's OEIS Frontend

A324563 Number T(n,k) of permutations p of [n] such that 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