Displaying 21-23 of 23 results found.
Least prime p such that n divides phi(p*n).
+10
1
2, 2, 3, 2, 5, 3, 7, 2, 3, 5, 11, 3, 13, 7, 31, 2, 17, 3, 19, 5, 7, 11, 23, 3, 5, 13, 3, 7, 29, 31, 31, 2, 67, 17, 71, 3, 37, 19, 13, 5, 41, 7, 43, 11, 31, 23, 47, 3, 7, 5, 103, 13, 53, 3, 11, 7, 19, 29, 59, 31, 61, 31, 7, 2, 131, 67, 67, 17, 139, 71, 71, 3, 73, 37, 31, 19, 463
a(n) = n - n/gcd(n, phi(n)), where phi is Euler totient function.
+10
1
0, 0, 0, 2, 0, 3, 0, 6, 6, 5, 0, 9, 0, 7, 0, 14, 0, 15, 0, 15, 14, 11, 0, 21, 20, 13, 24, 21, 0, 15, 0, 30, 0, 17, 0, 33, 0, 19, 26, 35, 0, 35, 0, 33, 30, 23, 0, 45, 42, 45, 0, 39, 0, 51, 44, 49, 38, 29, 0, 45, 0, 31, 56, 62, 0, 33, 0, 51, 0, 35, 0, 69, 0, 37, 60, 57, 0, 65, 0, 75, 78, 41, 0, 77, 0, 43, 0, 77, 0, 75
a(n) is the least number k such that the continued fraction for phi(k)/k contains exactly n elements.
+10
1
1, 2, 3, 15, 35, 33, 65, 215, 221, 551, 455, 2001, 3417, 3621, 11523, 16705, 16617, 69845, 107545, 157285, 324569, 358883, 1404949, 1569295, 3783970, 3106285, 7536065, 12216295, 10589487, 24038979, 57759065, 51961945, 177005465, 131462695, 741703701, 1467144445
Search completed in 0.017 seconds
| 