login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A369253
Parity of A038548, where A038548(n) is the number of divisors of n that are at most sqrt(n).
3
1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0
OFFSET
1
COMMENTS
Also parity of the Möbius transform of A369255.
FORMULA
a(n) = A000035(A038548(n)).
PROG
(PARI) A369253(n) = (sumdiv(n, d, 1-(bigomega(d)%2))%2);
CROSSREFS
Characteristic function of A369254.
Sequence in context: A353787 A297086 A349920 * A167752 A240025 A100923
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jan 24 2024
STATUS
approved