Number T(n,k) of ascent sequences of length n where the maximum of 0 and all letter multiplicities equals k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
A294219
Number T(n,k) of ascent sequences of length n where the maximum of 0 and all letter multiplicities equals 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) =1a(6) =0a(7) =1a(8) =3a(9) =1a(10) =0a(11) =1a(12) =9a(13) =4a(14) =1a(15) =0a(16) =1a(17) =26a(18) =20a(19) =5a(20) =1a(21) =0a(22) =1a(23) =82a(24) =97a(25) =30a(26) =6a(27) =1a(28) =0a(29) =1
External references
- oeis: A294219