Search: id:A093655
Results 1-1 of 1 results found.

%I A093655
%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,397,
%T A093655 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,41,397,
%U A093655 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.
%Y A093655 Sequence in context: A081727 A000020 A077014 this_sequence A023140 A145859 
               A145863
%Y A093655 Adjacent sequences: A093652 A093653 A093654 this_sequence A093656 A093657 
               A093658
%K A093655 nonn
%O A093655 1,4
%A A093655 Paul D. Hanna (pauldhanna(AT)juno.com), Apr 08 2004

Search completed in 0.001 seconds