Search: id:A014083
Results 1-1 of 1 results found.

%I A014083
%S A014083 0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,
%T A014083 0,0,1,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
%U A014083 0,0,0,0,0,1,1,2,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0
%N A014083 Occurrences of '1111' in binary expansion of n.
%H A014083 R. Stephan, <a href="somedcgf.html">Some divide-and-conquer sequences 
               ...</a>
%H A014083 R. Stephan, <a href="a079944.ps">Table of generating functions</a>
%F A014083 a(2n) = a(n), a(2n+1) = a(n) + [n congruent to 7 mod 8]. - Ralf Stephan 
               (ralf(AT)ark.in-berlin.de), Aug 21 2003
%F A014083 G.f.: 1/(1-x) * sum(k>=0, t^15(1-t)/(1-t^16), t=x^2^k). - Ralf Stephan 
               (ralf(AT)ark.in-berlin.de), Sep 08 2003
%p A014083 See A014081.
%o A014083 (PARI) u1111(n)=local(v):v=binary(n):sum(k=1,length(v)-3,v[k]&&v[k+1]&&v[k+2]&&v[k+3])
%Y A014083 Sequence in context: A130706 A000038 A063667 this_sequence A112315 A005926 
               A089803
%Y A014083 Adjacent sequences: A014080 A014081 A014082 this_sequence A014084 A014085 
               A014086
%K A014083 nonn
%O A014083 0,31
%A A014083 Simon Plouffe (simon.plouffe(AT)gmail.com)

Search completed in 0.001 seconds