Some properties of a Rudin-Shapiro-like sequence

From MaRDI portal
Publication:477769




Abstract: We introduce the sequence (in)ngeq0 defined by in=(1)inv2(n), where inv2(n) denotes the number of inversions (i.e., occurrences of 10 as a scattered subsequence) in the binary representation of n. We show that this sequence has many similarities to the classical Rudin-Shapiro sequence. In particular, if S(N) denotes the N-th partial sum of the sequence (in)ngeq0, we show that S(N)=G(log4N)sqrtN, where G is a certain function that oscillates periodically between sqrt3/3 and sqrt2.









This page was built for publication: Some properties of a Rudin-Shapiro-like sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477769)