A214015 - cp's OEIS frontend

A214015 Number of permutations A(n,k) in S_n with longest increasing subsequence of length <= k; square array A(n,k), n>=0, k>=0, read by antidiagonals.

n	a(n)
0	1
1	1
2	0
3	1
4	1
5	0
6	1
7	1
8	1
9	0
10	1
11	1
12	2
13	1
14	0
15	1
16	1
17	2
18	5
19	1
20	0
21	1
22	1
23	2
24	6
25	14
26	1
27	0
28	1
29	1
30	2
31	6
32	23
33	42
34	1
35	0
36	1
37	1
38	2
39	6
40	24
41	103
42	132
43	1
44	0
45	1
46	1
47	2
48	6
49	24
50	119
51	513
52	429
53	1
54	0
55	1
56	1
57	2
58	6
59	24
60	120
61	694
62	2761
63	1430
64	1
65	0
66	1
67	1
68	2
69	6
70	24
71	120
72	719
73	4582
74	15767
75	4862
76	1
77	0

[1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 2, 1, 0, 1, 1, 2, 5, 1, 0, 1, 1, 2, 6, 14, 1, 0, 1, 1, 2, 6, 23, 42, 1, 0, 1, 1, 2, 6, 24, 103, 132, 1, 0, 1, 1, 2, 6, 24, 119, 513, 429, 1, 0, 1, 1, 2, 6, 24, 120, 694, 2761, 1430, 1, 0, 1, 1, 2, 6, 24, 120, 719, 4582, 15767, 4862, 1, 0]

cp's OEIS Frontend

A214015 Number of permutations A(n,k) in S_n with longest increasing subsequence of length <= k; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

List of values