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

%I A036555
%S A036555 0,2,2,2,2,4,2,3,2,4,4,2,2,4,3,4,2,4,4,4,4,6,2,3,2,4,4,3,3,5,4,5,2,4,4,
%T A036555 4,4,6,4,5,4,6,6,2,2,4,3,4,2,4,4,4,4,6,3,4,3,5,5,4,4,6,5,6,2,4,4,4,4,6,
%U A036555 4,5,4,6,6,4,4,6,5,6,4,6,6,6,6,8,2,3,2,4,4,3,3,5,4,5,2,4,4
%N A036555 Number of bits of 3n in base 2.
%C A036555 a(n) is also the largest integer such that 2^a(n) divides binomial(6n,
               3n)=A066802(n) - Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 27 
               2002
%H A036555 T. D. Noe, <a href="b036555.txt">Table of n, a(n) for n=0..1000</a>
%H A036555 S. R. Finch, P. Sebah and Z.-Q. Bai, <a href="http://arXiv.org/abs/0802.2654">
               Odd Entries in Pascal's Trinomial Triangle</a> (arXiv:0802.2654)
%H A036555 Michael Gilleland, <a href="selfsimilar.html">Some Self-Similar Integer 
               Sequences</a>
%t A036555 Plus@@IntegerDigits[3n, 2]
%Y A036555 Cf. A036556, A036557.
%Y A036555 Cf. A099033.
%Y A036555 Sequence in context: A098219 A061389 A138011 this_sequence A046927 A084718 
               A154851
%Y A036555 Adjacent sequences: A036552 A036553 A036554 this_sequence A036556 A036557 
               A036558
%K A036555 nonn,base,nice
%O A036555 0,2
%A A036555 Hoey(AT)AIC.NRL.Navy.Mil

Search completed in 0.001 seconds