|
%I #3 Mar 30 2012 18:36:40
%S 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 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 41,397,41,397,397,6377
%N First column of lower triangular matrix A093654.
%C Related to the number of tournament sequences (A008934).
%C 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 a(2^n) = A008934(n) for n>=0.
%F a(n) = A008934(A000120(n-1)) for n>=1.
%Y Cf. A008934, A093655.
%Y Cf. A000120.
%K nonn
%O 1,4
%A _Paul D. Hanna_, Apr 08 2004
|
