1242241domain: NAppears in sequencesa(n) is the smallest number m with n divisors d such that d^m mod m = d.at n=23A371513a(n) is the least k that has exactly n proper divisors d such that (-d)^k == -d (mod k).at n=23A380393Expansion of 1/sqrt((1-x)^3 * (1-13*x)).at n=6A383951