|
%I #6 Jun 24 2014 01:08:21
%S 0,0,1,0,1,2,0,1,1,3,0,1,1,2,4,0,1,1,1,2,5,0,1,1,1,2,2,6,0,1,1,1,1,2,
%T 3,7,0,1,1,1,1,2,2,3,8,0,1,1,1,1,1,2,2,3,9,0,1,1,1,1,1,2,2,2,3,10,0,1,
%U 1,1,1,1,1,2,2,2,4,11,0,1,1,1,1,1,1,2,2,2,3,4,12,0,1,1,1,1,1,1,1,2,2,2
%N Number of 0's in the binary expansion of A066884(n+1).
%t a[n_] := Module[{}, r=Floor[(Sqrt[8n+1]-1)/2]; s=n-r*(r+1)/2; For[k=0, True, k++, If[s<Binomial[r-s+1+k, k], Return[k]]]]
%K easy,tabl,nonn
%O 0,6
%A Jared Ricks (jaredricks(AT)yahoo.com), Jan 31 2002
%E Edited by _Dean Hickerson_, Feb 16 2002
|
