T(m,n) is the number of ways to split two strings of length m and n, respectively, into the same number of nonempty parts such that at least one of the corresponding parts has length 1 and such that the parts have at most size 2.
A191588
T(m,n) is the number of ways to split two strings of length m and n, respectively, into the same number of nonempty parts such that at least one of the corresponding parts has length 1 and such that the parts have at most size 2.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =0a(4) =2a(5) =3a(6) =0a(7) =1a(8) =3a(9) =7a(10) =0a(11) =0a(12) =3a(13) =7a(14) =13a(15) =0a(16) =0a(17) =1a(18) =6a(19) =17a(20) =27a(21) =0a(22) =0a(23) =0a(24) =4a(25) =14a(26) =36a(27) =61a(28) =0a(29) =0
External references
- oeis: A191588