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”).

A353677
a(n) = 1 if n is an odd number of the form p^j * q^k, with p and q primes and gcd(phi(p^j), phi(q^k)) = 2, otherwise 0.
3
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0
OFFSET
1
COMMENTS
A necessary condition for a(n) = 1 is that at least one of the prime factors of n is of the form 4*m + 3 (A002145). - David A. Corneth, May 04 2022
FORMULA
a(n) = A000035(n) * A353678(n).
a(n) <= A353676(n).
PROG
(PARI) A353677(n) = if(!(n%2)||(2!=omega(n)), 0, my(f=factor(n)); (2==gcd(eulerphi(f[1, 1]^f[1, 2]), eulerphi(f[2, 1]^f[2, 2]))));
CROSSREFS
Characteristic function of A329229.
Sequence in context: A354989 A277161 A353481 * A353676 A340370 A216038
KEYWORD
nonn
AUTHOR
Antti Karttunen, May 03 2022
STATUS
approved