A267479 - cp's OEIS frontend

A267479 Number A(n,k) of words on {1,1,2,2,...,n,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	6
13	1
14	0
15	1
16	1
17	6
18	43
19	1
20	0
21	1
22	1
23	6
24	90
25	352
26	1
27	0
28	1
29	1
30	6
31	90
32	1879
33	3114
34	1
35	0
36	1
37	1
38	6
39	90
40	2520
41	47024
42	29004
43	1
44	0
45	1
46	1
47	6
48	90
49	2520
50	102011
51	1331664
52	280221
53	1
54	0
55	1
56	1
57	6
58	90
59	2520
60	113400
61	5176504
62	41250519
63	2782476
64	1
65	0

[1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 6, 1, 0, 1, 1, 6, 43, 1, 0, 1, 1, 6, 90, 352, 1, 0, 1, 1, 6, 90, 1879, 3114, 1, 0, 1, 1, 6, 90, 2520, 47024, 29004, 1, 0, 1, 1, 6, 90, 2520, 102011, 1331664, 280221, 1, 0, 1, 1, 6, 90, 2520, 113400, 5176504, 41250519, 2782476, 1, 0]

cp's OEIS Frontend

A267479 Number A(n,k) of words on {1,1,2,2,...,n,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