login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A045654 Number of 2n-bead balanced binary strings, rotationally equivalent to complement. 3

%I

%S 1,2,6,8,22,32,72,128,278,512,1056,2048,4168,8192,16512,32768,65814,

%T 131072,262656,524288,1049632,2097152,4196352,8388608,16781384,

%U 33554432,67117056,134217728,268451968,536870912,1073774592,2147483648

%N Number of 2n-bead balanced binary strings, rotationally equivalent to complement.

%H R. Stephan, <a href="/somedcgf.html">Some divide-and-conquer sequences ...</a>

%H R. Stephan, <a href="/A079944/a079944.ps">Table of generating functions</a>

%F a(0)=1, a(2n) = a(n)+2^(2n), a(2n+1) = 2^(2n+1). - _Ralf Stephan_, Jun 07 2003

%F G.f.: 1/(1-x) + sum(k>=0, t(1+2t-2t^2)/(1-t^2)/(1-2t), t=x^2^k). - _Ralf Stephan_, Aug 30 2003

%F For n >= 1, a(n) = sum(0<=k<=A007814(n), 2^(n/2^k)). - _David W. Wilson_, Jan 01 2012

%K nonn

%O 0,2

%A _David W. Wilson_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 19 15:02 EDT 2019. Contains 321330 sequences. (Running on oeis4.)