a(n) is the smallest k with n prime factors such that p^k == p (mod k) for every prime p dividing k.

A294179

a(n) is the smallest k with n prime factors such that p^k == p (mod k) for every prime p dividing k.

Terms

    a(0) =2a(1) =65a(2) =561a(3) =41041a(4) =825265a(5) =321197185a(6) =5394826801a(7) =232250619601

External references