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 A093663 #3 Mar 30 2012 18:36:40 %S A093663 1,2,2,5,2,5,5,17,2,5,5,17,5,17,17,86,2,5,5,17,5,17,17,86,5,17,17,86, %T A093663 17,86,86,698,2,5,5,17,5,17,17,86,5,17,17,86,17,86,86,698,5,17,17,86, %U A093663 17,86,86,698,17,86,86,698,86,698,698,9551 %N A093663 Row sums of lower triangular matrix A093662. %C A093663 a(n) equals the number of sequences of length A000120(n-1) that satisfy an ordering restriction (cf. A016121), where A000120(n-1) is the number of 1's in the binary expansion of n-1. %F A093663 a(2^n) = A016121(n) for n>=0. a(2^n+2^m) = a(2^(m+1)) for n>m>=0. %F A093663 a(n) = A016121(A000120(n-1)) for n>=1. %Y A093663 Cf. A016121, A093662, A093664. %Y A093663 Cf. A000120. %K A093663 nonn %O A093663 1,2 %A A093663 _Paul D. Hanna_, Apr 08 2004