Search: id:A053644
Results 1-1 of 1 results found.
%I A053644
%S A053644 0,1,2,2,4,4,4,4,8,8,8,8,8,8,8,8,16,16,16,16,16,16,16,16,16,16,16,16,16,
%T A053644 16,16,16,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,
%U A053644 32,32,32,32,32,32,32,32,32,32,32,32,64,64,64,64,64,64,64,64,64,64,64
%N A053644 Most significant bit of n, msb(n); largest power of 2 less than or equal
to n; write n in binary and change all but the first digit to zero.
%C A053644 Except for the initial term, 2^n appears 2^n times. - Lekraj Beedassy
(blekraj(AT)yahoo.com), May 26 2005
%H A053644 N. J. A. Sloane, Transforms
%H A053644 R. Stephan, Some divide-and-conquer sequences
...
%H A053644 R. Stephan, Table of generating functions
%F A053644 a(n) = a(floor(n / 2)) * 2.
%F A053644 a(n)=2^A000523(n)
%F A053644 a(0)=0, a(1)=1 and a(n+1)=a(n)*floor(n/a(n)) - Benoit Cloitre (benoit7848c(AT)orange.fr),
Aug 17 2002
%F A053644 G.f.: 1/(1-x) * (x + sum_{k>=1} 2^(k-1)*x^2^k). - Ralf Stephan (ralf(AT)ark.in-berlin.de),
Apr 18 2003
%F A053644 a(n) = (A003817(n)+1)/2 = A091940(n)+1. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com),
Feb 15 2004
%Y A053644 See A000035 for least significant bit(n).
%Y A053644 MASKTRANS transform of A055975 (prepended with 0), MASKTRANSi transform
of A048678.
%Y A053644 From n >= 1 onward, A053644[n] = A062383[n]/2
%Y A053644 Bisection of A065267, A065279, A065291, A072376.
%Y A053644 First differences of A063915. Cf. A076877, A073121.
%Y A053644 This is Guy Steele's sequence GS(5, 5) (see A135416).
%Y A053644 Contribution from Johannes W. Meijer (meijgia(AT)hotmail.com), May 24
2009: (Start)
%Y A053644 Equals for n>=1 the first right hand column of A160464.
%Y A053644 (End)
%Y A053644 Sequence in context: A098667 A105678 A028397 this_sequence A039593 A101656
A090557
%Y A053644 Adjacent sequences: A053641 A053642 A053643 this_sequence A053645 A053646
A053647
%K A053644 easy,nonn,nice
%O A053644 0,3
%A A053644 Henry Bottomley (se16(AT)btinternet.com), Mar 22 2000
Search completed in 0.002 seconds