# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a093655
Showing 1-1 of 1

%I A093655 #3 Mar 30 2012 18:36:40
%S A093655 1,1,1,2,1,2,2,7,1,2,2,7,2,7,7,41,1,2,2,7,2,7,7,41,2,7,7,41,7,41,41,
%T A093655 397,1,2,2,7,2,7,7,41,2,7,7,41,7,41,41,397,2,7,7,41,7,41,41,397,7,41,
%U A093655 41,397,41,397,397,6377
%N A093655 First column of lower triangular matrix A093654.
%C A093655 Related to the number of tournament sequences (A008934).
%C A093655 a(n) equals the number of tournament sequences (A008934) of length A000120(n-1), which is the number of 1's in the binary expansion of n-1.
%F A093655 a(2^n) = A008934(n) for n>=0.
%F A093655 a(n) = A008934(A000120(n-1)) for n>=1.
%Y A093655 Cf. A008934, A093655.
%Y A093655 Cf. A000120.
%K A093655 nonn
%O A093655 1,4
%A A093655 _Paul D. Hanna_, Apr 08 2004

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE