A333633 Smallest m such that sigma(m) == 2*n (mod phi(m)) or 0 if no solution exists.
1, 5, 24, 22, 21, 40, 48, 136, 110, 90, 88, 656, 102, 80, 96, 68, 55, 464, 65, 117, 91, 116, 85, 272, 95, 148, 133, 164, 115, 160, 147, 333, 247, 212, 145, 243968, 155, 244, 217, 405, 230, 11072, 185, 292, 259, 1184, 205, 237824, 215, 657, 301, 356, 189, 343, 329, 388, 559, 404
Offset: 0
Keywords
Links
- Michel Marcus, Table of n, a(n) for n = 0..220
Programs
-
PARI
g(n) = my(f=factor(n)); sigma(f) % eulerphi(f); a(n) = {n *= 2; my(k=1); while (g(k) != n, k++); k;} \\ Michel Marcus, Mar 30 2020
Extensions
a(0) prepended by Jinyuan Wang, Mar 30 2020
Comments