140505

Appears in sequences

• a(n) = (n+1)*(2*n+1)*(3*n+1).at n=28A011199
• a(n) is the smallest number m with n divisors d such that d^m mod m = d.at n=13A371513
• a(n) is the least k that has exactly n proper divisors d such that (-d)^k == -d (mod k).at n=13A380393