309036
domain: N
Appears in sequences
- Triangle read by rows: T(n,k)=number of ordered trees with n edges and k branch nodes at odd height.at n=43A091958
- Number of Dyck paths of semilength n having exactly three (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=9A243772