Numbers such that antisigma(n) mod sigma(n) = phi(n), where antisigma(n) is the sum of the numbers less than n that do not divide n, sigma(n) is the sum of the divisors of n and phi(n) is the Euler totient function of n.

A272338

Numbers such that antisigma(n) mod sigma(n) = phi(n), where antisigma(n) is the sum of the numbers less than n that do not divide n, sigma(n) is the sum of the divisors of n and phi(n) is the Euler totient function of n.

Terms

    a(0) =3a(1) =9a(2) =27a(3) =81a(4) =243a(5) =319a(6) =729a(7) =2187a(8) =3615a(9) =6561a(10) =8159a(11) =9807a(12) =19683a(13) =32791a(14) =59049a(15) =103679a(16) =177147a(17) =432864a(18) =531441a(19) =788852a(20) =871215a(21) =1594323a(22) =2779519a(23) =2826863a(24) =2858240a(25) =4782969a(26) =7213536a(27) =10036415a(28) =14348907a(29) =20428863

External references