A126217 - cp's OEIS frontend

A126217 Triangle read by rows: T(n,k) is the number of 321-avoiding permutations of {1,2,...,n} having longest increasing subsequence of length k (0<=k<=n).

n	a(n)
0	1
1	0
2	1
3	0
4	1
5	1
6	0
7	0
8	4
9	1
10	0
11	0
12	4
13	9
14	1
15	0
16	0
17	0
18	25
19	16
20	1
21	0
22	0
23	0
24	25
25	81
26	25
27	1
28	0
29	0
30	0
31	0
32	196
33	196
34	36
35	1
36	0
37	0
38	0
39	0
40	196
41	784
42	400
43	49
44	1
45	0
46	0
47	0
48	0
49	0
50	1764
51	2304
52	729
53	64
54	1
55	0
56	0
57	0
58	0
59	0
60	1764
61	8100
62	5625
63	1225
64	81
65	1
66	0
67	0
68	0
69	0
70	0
71	0
72	17424
73	27225
74	12100
75	1936
76	100
77	1
78	0
79	0
80	0
81	0
82	0
83	0
84	17424
85	88209
86	75625
87	23716
88	2916
89	121
90	1

[1, 0, 1, 0, 1, 1, 0, 0, 4, 1, 0, 0, 4, 9, 1, 0, 0, 0, 25, 16, 1, 0, 0, 0, 25, 81, 25, 1, 0, 0, 0, 0, 196, 196, 36, 1, 0, 0, 0, 0, 196, 784, 400, 49, 1, 0, 0, 0, 0, 0, 1764, 2304, 729, 64, 1, 0, 0, 0, 0, 0, 1764, 8100, 5625, 1225, 81, 1, 0, 0, 0, 0, 0, 0, 17424, 27225, 12100, 1936, 100, 1, 0, 0, 0, 0, 0, 0, 17424, 88209, 75625, 23716, 2916, 121, 1]

cp's OEIS Frontend

A126217 Triangle read by rows: T(n,k) is the number of 321-avoiding permutations of {1,2,...,n} having longest increasing subsequence of length k (0<=k<=n).

Table of values

List of values