86633

Appears in sequences

• Number of binary words of length n containing no subword 01101.at n=17A209888
• Number of (n+1)X(3+1) arrays of permutations of 0..n*4+3 with each element having index change (+-,+-) 0,2 1,1 or 1,0.at n=2A263970
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change (+-,+-) 0,2 1,1 or 1,0.at n=12A263973
• Number of (3+1)X(n+1) arrays of permutations of 0..n*4+3 with each element having index change (+-,+-) 0,2 1,1 or 1,0.at n=2A263975
• Number T(n,k) of binary words of length n containing exactly k (possibly overlapping) occurrences of the subword 01101; triangle T(n,k), n>=0, k=0..max(0,floor((n-2)/3)), read by rows.at n=47A277751