A267480 - cp's OEIS frontend

A267480 Number T(n,k) of words on {1,1,2,2,...,n,n} with longest increasing subsequence of length k; 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	5
6	0
7	1
8	42
9	47
10	0
11	1
12	351
13	1527
14	641
15	0
16	1
17	3113
18	43910
19	54987
20	11389
21	0
22	1
23	29003
24	1302660
25	3844840
26	2059147
27	248749
28	0
29	1
30	280220
31	40970298
32	265777225
33	285588543
34	82025038
35	6439075
36	0
37	1
38	2782475
39	1364750889
40	19104601915
41	37783672691
42	19773928713
43	3507289363
44	192621953

[1, 0, 1, 0, 1, 5, 0, 1, 42, 47, 0, 1, 351, 1527, 641, 0, 1, 3113, 43910, 54987, 11389, 0, 1, 29003, 1302660, 3844840, 2059147, 248749, 0, 1, 280220, 40970298, 265777225, 285588543, 82025038, 6439075, 0, 1, 2782475, 1364750889, 19104601915, 37783672691, 19773928713, 3507289363, 192621953]

cp's OEIS Frontend

A267480 Number T(n,k) of words on {1,1,2,2,...,n,n} with longest increasing subsequence of length k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

List of values