A370506 - cp's OEIS frontend

A370506 T(n,k) is the number permutations p of [n] that are j-dist-increasing for exactly k distinct values j in [n], 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	3
8	2
9	1
10	0
11	11
12	8
13	4
14	1
15	0
16	55
17	38
18	19
19	7
20	1
21	0
22	319
23	228
24	110
25	50
26	12
27	1
28	0
29	2233
30	1574
31	775
32	322
33	115
34	20
35	1
36	0
37	17641
38	12524
39	6216
40	2611
41	1033
42	261
43	33
44	1
45	0
46	158769
47	112084
48	55692
49	23585
50	9103
51	3006
52	586
53	54
54	1
55	0
56	1578667
57	1119496
58	556754
59	238425
60	91764
61	33929
62	8372
63	1304
64	88
65	1

[1, 0, 1, 0, 1, 1, 0, 3, 2, 1, 0, 11, 8, 4, 1, 0, 55, 38, 19, 7, 1, 0, 319, 228, 110, 50, 12, 1, 0, 2233, 1574, 775, 322, 115, 20, 1, 0, 17641, 12524, 6216, 2611, 1033, 261, 33, 1, 0, 158769, 112084, 55692, 23585, 9103, 3006, 586, 54, 1, 0, 1578667, 1119496, 556754, 238425, 91764, 33929, 8372, 1304, 88, 1]

cp's OEIS Frontend

A370506 T(n,k) is the number permutations p of [n] that are j-dist-increasing for exactly k distinct values j in [n], 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