%N a(n)=Sum(i+j+k+l+...+r+s=n) A005316(i)*A005316(j)*...*A005316(s) and the ordered partition of n runs over all odd i, all even j,k,.., r, all i,j,...,r,s>=1.
%C A lower bound to A076876. a(n) counts the cases where all crossings k are East of the crossings i, all crossings l East of the crossings j etc. Some backwinding interlaced crossings are counted in A076876(n) but not here.
%A _R. J. Mathar_, May 06 2006