58590
domain: N
Appears in sequences
- Numbers k such that 2^k == -1 (mod k-1).at n=7A055685
- Numbers k such that 8^k == -1 (mod k-1).at n=17A055691
- Reverse of largest prime factor of n = smallest prime factor of n+1; a(1)=1.at n=33A071393
- a(n) = n*(2*n^2 + 5*n + 3).at n=30A163815
- Smallest number which is an unordered sum of two odd abundant numbers in exactly n ways.at n=35A187743
- Number of distinct values of the sum of 2 products of three 0..n integers.at n=33A225259
- Numbers k such that phi(x) = 12*k+2 is solvable, where phi is Euler's totient A000010.at n=38A289364
- a(n) = (n - 1) * (n - 2) * sigma(n).at n=31A374915