%I #11 Oct 22 2018 12:45:01
%S 1,2,4,6,8,9,13,17,22,28,30,30,30,38,45,45,45,45,45,53,59,59,59,59,59
%N Number of partisan games for which A106486-encoding of the minimal representation is less than 2^n.
%C Number of terms of A126011 in range [0,2^n[.
%H A. Karttunen, <a href="/A126000/a126000.scm.txt">Scheme-program for computing this sequence.</a>
%F For all n, a(2*A114561(n)) = A065401(n).
%Y Cf. A065401, A125999, A126010, A126011, A126012, A320006.
%K nonn,more
%O 0,2
%A _Antti Karttunen_, Jan 02 2007