%I A107345
%S A107345 1,1,1,1,2,1,1,1,3,2,1,1,2,1,1,1,4,3,3,2,3,1,1,1,3,2,1,1,2,1,1,1,5,4,6,
%T A107345 3,6,3,3,2,6,3,1,1,3,1,1,1,4,3,3,2,3,1,1,1,3,2,1,1,2,1,1,1,6,5,10,4,10,
%U A107345 6,6,3,10,6,4,3,6,3,3,2,10,6,4,3,4,1,1,1,6,3,1,1,3,1,1,1,5,4,6,3,6,3,3
%N A107345 From the binary representation of n: binomial(number of zeros, number 
               of blocks of contiguous zeros).
%C A107345 a(n) = binomial(A023416(n), A087116(n)); a(A003754(n)) = 1.
%C A107345 First occurrence of k: 1, 4, 8, 16, 32, 34, 128, 256, 512, 66, 2048, 
               4096, 8192, 16384, 130, 65536, 131072, 262144, 524288, 266, 258, 
               ..., . k must occur by 2^k. - Robert G. Wilson v.
%C A107345 Record values: 1, 4, 8, 16, 32, 34, 66, 130, 258, 514, 522, 1026, 1034, 
               2058, 4106, 4138, 8202, 8234, 16394, 16426, 32810, 65578, 65706, 
               131114, 131242, 262186, 262314, 524458, 1048746, 1049258, 2097322, 
               2097834, 4194474, 4194986, 8389290, 8391338, ..., . - Robert G. Wilson 
               v.
%H A107345 <a href="Sindx_Bi.html#binary">Index entries for sequences related to 
               binary expansion of n</a>
%t A107345 f[n_] := Block[{id = IntegerDigits[n, 2]}, Binomial[ Count[id, 0], Floor[(Length@ 
               Split@ id + 1)/2]]]; Table[f@n, {n, 0, 102}] (* Robert G. Wilson 
               v, (rgwv(AT)rgwv.com), Apr 01 2008 *)
%Y A107345 Cf. A007088, A107782, A136277.
%Y A107345 Sequence in context: A091050 A005361 A008479 this_sequence A000688 A038538 
               A088529
%Y A107345 Adjacent sequences: A107342 A107343 A107344 this_sequence A107346 A107347 
               A107348
%K A107345 nonn
%O A107345 0,5
%A A107345 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 23 2005