On the Nth maximum order complexity and the expansion complexity of a Rudin-Shapiro-like sequence

Based on the parity of the number of occurrences of a pattern 10 as a scattered subsequence in the binary representation of integers, a Rudin-Shapiro-like sequence is defined by Lafrance, Rampersad and Yee. The N th maximum order complexity and the expansion complexity of this Rudin-Shapiro-like sequence are calculated in this paper.