Triangle read by rows: T(n,k) is the number of binary strings of length n that contain exactly k runs of 1's of even length, 0 <= k <= floor((n+1)/3).
A391669
Triangle read by rows: T(n,k) is the number of binary strings of length n that contain exactly k runs of 1's of even length, 0 <= k <= floor((n+1)/3).
Terms
- a(0) =1a(1) =2a(2) =3a(3) =1a(4) =6a(5) =2a(6) =10a(7) =6a(8) =19a(9) =12a(10) =1a(11) =33a(12) =28a(13) =3a(14) =61a(15) =56a(16) =11a(17) =108a(18) =119a(19) =28a(20) =1a(21) =197a(22) =236a(23) =75a(24) =4a(25) =352a(26) =479a(27) =176a(28) =17a(29) =638
External references
- oeis: A391669