A175597 Minimal run length in binary representation of n.
1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 2, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 3, 1, 1, 1, 2, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 1
Offset: 1
Crossrefs
Cf. A043276.
Programs
-
Maple
A175597 := proc(n) local dgs,odig,runl,thisr,i ; dgs := convert(n,base,2) ; odig := -1 ; runl := nops(dgs)+1 ; thisr := 0 ; for i from 1 to nops(dgs) do d := op(i,dgs) ; if i = 1 then thisr := 1; else if d <> odig then if thisr < runl then runl := thisr ; end if; thisr := 1 ; else thisr := thisr+1 ; end if; end if; odig := d ; end do: if thisr < runl then runl := thisr ; end if; return runl ; end proc: seq(A175597(n),n=1..130) ; # R. J. Mathar, Jul 26 2010