A370507 - cp's OEIS frontend

A370507 T(n,k) is the number permutations p of [n] that are k-dist-increasing but not j-dist-increasing for any j where p is j-dist-increasing if j>=0 and p(i) for all i in [n-j]; 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	2
9	3
10	0
11	1
12	5
13	7
14	11
15	0
16	1
17	9
18	22
19	33
20	55
21	0
22	1
23	19
24	77
25	112
26	192
27	319
28	0
29	1
30	34
31	189
32	480
33	788
34	1315
35	2233
36	0
37	1
38	69
39	526
40	2187
41	3500
42	5987
43	10409
44	17641
45	0
46	1
47	125
48	1625
49	6811
50	18273
51	30568
52	53791
53	92917
54	158769
55	0
56	1
57	251
58	4111
59	23507
60	101424
61	167480
62	299769
63	528253
64	925337
65	1578667

[1, 0, 1, 0, 1, 1, 0, 1, 2, 3, 0, 1, 5, 7, 11, 0, 1, 9, 22, 33, 55, 0, 1, 19, 77, 112, 192, 319, 0, 1, 34, 189, 480, 788, 1315, 2233, 0, 1, 69, 526, 2187, 3500, 5987, 10409, 17641, 0, 1, 125, 1625, 6811, 18273, 30568, 53791, 92917, 158769, 0, 1, 251, 4111, 23507, 101424, 167480, 299769, 528253, 925337, 1578667]

cp's OEIS Frontend

A370507 T(n,k) is the number permutations p of [n] that are k-dist-increasing but not j-dist-increasing for any j where p is j-dist-increasing if j>=0 and p(i) for all i in [n-j]; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

List of values