1,1

An example of a sequence with property that the fraction of 1's in the first n terms does not converge to a limit. - njas, Sep 24 2007

R. Stephan, Some divide-and-conquer sequences ...

R. Stephan, Table of generating functions

R. Stephan, Divide-and-conquer generating functions. I. Elementary sequences

a(n)=(1/2)*(1+(-1)^floor(log_2(n))). - Benoit Cloitre, Feb 22 2003

G.f.: 1/(1-x) * sum(k>=0, (-1)^k*x^2^k). - Ralf Stephan (ralf(AT)ark.in-berlin.de), Jul 12 2003

a(n)=1-a(floor(n/2)). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Aug 04 2003

a(n)=A115253(2n, n) mod 2; - Paul Barry (pbarry(AT)wit.ie), Jan 18 2006

f0 := n->[seq(0, i=1..2^n)]; f1 := n->[seq(1, i=1..2^n)]; s := []; for i from 0 to 4 do s := [op(s), op(f1(2*i)), op(f0(2*i+1))]; od: A030300 := s;

Cf. A030301. Partial sums give A079947.

a(n) = A065359(n) + A083905(n).

Sequence in context: A071001 A072792 A116937 this_sequence A072770 A071674 A090172

Adjacent sequences: A030297 A030298 A030299 this_sequence A030301 A030302 A030303

nonn,easy

Jean-Paul Delahaye (Jean-Paul.Delahaye(AT)lifl.fr)