169352

Appears in sequences

• Number of Dyck paths of semilength n having exactly six (possibly overlapping) occurrences of the consecutive step pattern given by the binary expansion of n, where 1=U=(1,1) and 0=D=(1,-1).at n=8A243775
• Number of length n+1 0..4 arrays with the sum of the minimum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.at n=6A250415
• T(n,k)=Number of length n+1 0..k arrays with the sum of the minimum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.at n=51A250419
• Number of length 7+1 0..n arrays with the sum of the minimum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.at n=3A250424