Triangle T(n,k), n>=2, 0<=k<=n-2, read by rows: numbers of binary words of length n containing at least one subword 10^{k}1 and no subwords 10^{i}1 with i<k.
A143291
Triangle T(n,k), n>=2, 0<=k<=n-2, read by rows: numbers of binary words of length n containing at least one subword 10^{k}1 and no subwords 10^{i}1 with i<k.
Terms
- a(0) =1a(1) =3a(2) =1a(3) =8a(4) =2a(5) =1a(6) =19a(7) =4a(8) =2a(9) =1a(10) =43a(11) =8a(12) =3a(13) =2a(14) =1a(15) =94a(16) =15a(17) =5a(18) =3a(19) =2a(20) =1a(21) =201a(22) =27a(23) =9a(24) =4a(25) =3a(26) =2a(27) =1a(28) =423a(29) =48
External references
- oeis: A143291