30534805

Appears in sequences

• Square array A(n, k) read by antidiagonals downwards: smallest base-n Fermat pseudoprime with k distinct prime factors for k, n >= 2.at n=23A271873
• a(n) is the smallest number m with n divisors d such that d^m mod m = d.at n=29A371513
• a(n) is the least k that has exactly n proper divisors d such that (-d)^k == -d (mod k).at n=29A380393