The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A033264 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
newer changes | Showing entries 11-20 | older changes

A033264

Number of blocks of {1,0} in the binary expansion of n.
(history; published version)

#44 by Harvey P. Dale at Thu Jan 26 11:11:00 EST 2017

STATUS

editing

approved

#43 by Harvey P. Dale at Thu Jan 26 11:10:52 EST 2017

MATHEMATICA

Table[SequenceCount[IntegerDigits[n, 2], {1, 0}], {n, 110}] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Jan 26 2017 *)

STATUS

approved

editing

#42 by N. J. A. Sloane at Sun Jan 17 20:47:46 EST 2016

STATUS

editing

approved

#41 by N. J. A. Sloane at Sun Jan 17 20:47:44 EST 2016

CROSSREFS

Cf. A175047, A087116. [From Reinhard Zumkeller, Dec 12 2009]

Cf. also A175047, A030308.

Essentially the same as A087116.

STATUS

proposed

editing

#40 by Jonathan Sondow at Sun Jan 17 18:10:54 EST 2016

STATUS

editing

proposed

#39 by Jonathan Sondow at Sun Jan 17 18:10:43 EST 2016

FORMULA

a(n) = A087116(n) for n > 0 since strings of 0s alternate with strings of 1s, which end in (1,0). - Jonathan Sondow, Jan 17 2016

STATUS

approved

editing

#38 by Charles R Greathouse IV at Mon Aug 31 14:40:08 EDT 2015

STATUS

proposed

approved

#37 by Robert Israel at Mon Aug 31 14:39:18 EDT 2015

STATUS

editing

proposed

#36 by Robert Israel at Mon Aug 31 14:39:08 EDT 2015

MAPLE

f:= proc(n) option remember; local k;

k:= n mod 4;

if k = 2 then procname((n-2)/4) + 1

elif k = 3 then procname((n-3)/4)

else procname((n-k)/2)

fi

end proc:

f(1):= 0: f(0):= q:

seq(f(i), i=1..100); # Robert Israel, Aug 31 2015

STATUS

proposed

editing

#35 by Michael De Vlieger at Mon Aug 31 09:32:09 EDT 2015

STATUS

editing

proposed