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.
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.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =5a(6) =0a(7) =1a(8) =42a(9) =47a(10) =0a(11) =1a(12) =351a(13) =1527a(14) =641a(15) =0a(16) =1a(17) =3113a(18) =43910a(19) =54987a(20) =11389a(21) =0a(22) =1a(23) =29003a(24) =1302660a(25) =3844840a(26) =2059147a(27) =248749a(28) =0a(29) =1
External references
- oeis: A267480