a(n) is the smallest k with n prime factors such that 2^(k-1) == 1 (mod k) and p-1 does not divide k-1 for every prime p dividing k.
A316908
a(n) is the smallest k with n prime factors such that 2^(k-1) == 1 (mod k) and p-1 does not divide k-1 for every prime p dividing k.
Terms
- a(0) =7957a(1) =617093a(2) =134564501a(3) =384266404601
External references
- oeis: A316908