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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A295297 a(n) = (A000120(n) + A000203(n)) mod 2. 10
0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1
COMMENTS
Characteristic function of A295299.
LINKS
FORMULA
a(n) = A000035(A000120(n) + A000203(n)).
a(n) = A010060(n) XOR A053866(n), where XOR is a bitwise-XOR (A003987).
a(n) = A294898(n) mod 2 = A294899(n) mod 2.
a(n) = A295875(A156552(n)). - Antti Karttunen, Dec 02 2017
MATHEMATICA
Array[Mod[DivisorSigma[1, #] + DigitCount[#, 2, 1], 2] &, 120] (* Michael De Vlieger, Nov 26 2017 *)
PROG
(Scheme) (define (A295297 n) (A000035 (+ (A000203 n) (A000120 n))))
(PARI) a(n) = (hammingweight(n) + sigma(n)) % 2; \\ Michel Marcus, Dec 02 2017
CROSSREFS
Cf. A295298 (positions of zeros), A295299 (of nonzeros).
Sequence in context: A277147 A248747 A369665 * A011691 A011684 A011674
KEYWORD
nonn
AUTHOR
Antti Karttunen, Nov 26 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 14:35 EDT 2024. Contains 371989 sequences. (Running on oeis4.)