Numbers k such that phi(k)==1 (mod bigomega(k)) where phi(n)=A000010(n) is the Euler totient function and bigomega(n)=A001222(n) is the number of prime divisors of n (counted with multiplicity).
A066934
Numbers k such that phi(k)==1 (mod bigomega(k)) where phi(n)=A000010(n) is the Euler totient function and bigomega(n)=A001222(n) is the number of prime divisors of n (counted with multiplicity).
Terms
- a(0) =8a(1) =12a(2) =32a(3) =48a(4) =75a(5) =108a(6) =110a(7) =125a(8) =128a(9) =170a(10) =192a(11) =208a(12) =230a(13) =280a(14) =290a(15) =312a(16) =363a(17) =368a(18) =374a(19) =405a(20) =410a(21) =420a(22) =470a(23) =506a(24) =530a(25) =552a(26) =590a(27) =638a(28) =680a(29) =684
External references
- oeis: A066934