%I A014082
%S A014082 0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,2,0,0,0,0,0,0,0,1,0,0,0,0,1,1,2,3,0,0,0,
%T A014082 0,0,0,0,1,0,0,0,0,0,0,1,2,0,0,0,0,0,0,0,1,1,1,1,1,2,2,3,4,0,0,0,0,0,0,
%U A014082 0,1,0,0,0,0,0,0,1,2,0,0,0,0,0,0,0,1,0,0,0,0,1,1,2,3,0,0,0,0,0,0,0,1,0
%N A014082 Occurrences of '111' in binary expansion of n.
%H A014082 R. Stephan, <a href="somedcgf.html">Some divide-and-conquer sequences 
               ...</a>
%H A014082 R. Stephan, <a href="a079944.ps">Table of generating functions</a>
%H A014082 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               DigitBlock.html">Link to a section of The World of Mathematics.</
               a>
%H A014082 <a href="Sindx_Bi.html#binary">Index entries for sequences related to 
               binary expansion of n</a>
%F A014082 a(2n) = a(n), a(2n+1) = a(n) + [n congruent to 3 mod 4]. - Ralf Stephan 
               (ralf(AT)ark.in-berlin.de), Aug 21 2003
%F A014082 G.f.: 1/(1-x) * sum(k>=0, t^7(1-t)/(1-t^8), t=x^2^k). - Ralf Stephan 
               (ralf(AT)ark.in-berlin.de), Sep 08 2003
%p A014082 See A014081.
%t A014082 f[n_] := Count[ Partition[ IntegerDigits[n, 2], 3, 1], {1, 1, 1}]; Table[f@n, 
               {n, 0, 104}] [From Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 02 
               2009]
%Y A014082 Cf. A014081, A033264, A056974, A056975, A056976, A056977, A056978, A056979, 
               A056980.
%Y A014082 Sequence in context: A104488 A010103 A086078 this_sequence A102354 A162641 
               A087781
%Y A014082 Adjacent sequences: A014079 A014080 A014081 this_sequence A014083 A014084 
               A014085
%K A014082 nonn
%O A014082 0,16
%A A014082 Simon Plouffe (simon.plouffe(AT)gmail.com)