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

%I A126806
%S A126806 1,2,2,11,11,46,46,707,707,707,2831,2831,11955,11962,45256,45256
%N A126806 Smallest number k such that 2^n divides A066796(k) = Sum(i=1,k,binomial(2*i,
               i)).
%C A126806 a(17)>75000. - Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 25 2007
%t A126806 sb[1] = 2; sb[k_] := sb[k] = sb[k - 1] + Binomial[2k, k]; f[n_] := Block[{k 
               = 1}, While[ Mod[sb@k, 2^n] != 0, k++ ]; k]; Do[Print@ f@n, {n, 0, 
               15}] - Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 25 2007
%Y A126806 Cf. A066796.
%Y A126806 Sequence in context: A037234 A141651 A090525 this_sequence A121871 A151365 
               A090527
%Y A126806 Adjacent sequences: A126803 A126804 A126805 this_sequence A126807 A126808 
               A126809
%K A126806 more,nonn
%O A126806 1,2
%A A126806 Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 23 2007
%E A126806 a(11)-a(16) from Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 25 2007

Search completed in 0.001 seconds