[go: up one dir, main page]

login
A353811
a(n) = 1 if sigma(n) is odd, and has an odd number of prime factors (with multiplicity), otherwise 0. Here sigma is the sum of divisors function.
3
0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1
OFFSET
1
FORMULA
a(n) = A053866(n) * A353810(n).
a(n) = A353558(A000203(n)).
a(n) = A347870(n) - A353812(n).
MATHEMATICA
a[n_] := If[OddQ[s = DivisorSigma[1, n]] && OddQ[PrimeOmega[s]], 1, 0]; Array[a, 100] (* Amiram Eldar, May 13 2022 *)
PROG
(PARI) A353811(n) = { my(s=sigma(n)); ((s%2) && (bigomega(s)%2)); };
KEYWORD
nonn
AUTHOR
Antti Karttunen, May 13 2022
STATUS
approved