This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A107321 #7 Jul 29 2013 08:36:01 %S A107321 1,1,2,3,8,14,42,79,254,506,1702,3548,12320,26666,94794,211751,766362, %T A107321 1758352,6453812,15150922,56238710,134659120 %N A107321 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 A107321 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. %K A107321 nonn,more %O A107321 0,3 %A A107321 _R. J. Mathar_, May 06 2006