The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A295890 a(n) = 1 if binary weights of n and 3n have different parity, 0 otherwise; a(n) = A010060(n) XOR A010060(3n). 4
 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0 COMMENTS Thue-Morse sequence A010060(n) xored with its trisection, A293162(n) = A010060(3n). LINKS Antti Karttunen, Table of n, a(n) for n = 0..65537 Index entries for sequences related to binary expansion of n. Index entries for characteristic functions. FORMULA a(n) = (A000120(n) + A000120(3*n)) mod 2. a(n) = A010060(n) + A293162(n) mod 2. a(n) = 1 - A295889(n). a(A003714(n)) = A095076(n). For n >= 1, a(A003961(n)) = abs(A295891(n) - A295891(2*n)). MATHEMATICA a[n_] := If[Mod[DigitCount[n, 2, 1], 2] == Mod[DigitCount[3*n, 2, 1], 2], 0, 1]; Array[a, 100, 0] (* Amiram Eldar, Feb 07 2023 *) PROG (Scheme) (define (A295890 n) (A000035 (+ (A000120 n) (A000120 (* 3 n))))) CROSSREFS Cf. A000035, A000120, A010060, A293162, A295889, A295891. Cf. also A003714, A095076. Sequence in context: A029691 A209229 A365089 * A342704 A284622 A215581 Adjacent sequences: A295887 A295888 A295889 * A295891 A295892 A295893 KEYWORD nonn,base AUTHOR Antti Karttunen, Nov 30 2017 STATUS approved

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

Last modified July 21 14:09 EDT 2024. Contains 374474 sequences. (Running on oeis4.)