OFFSET
1,1
COMMENTS
Proth's theorem asserts that p=1+k*2^m (with odd k < 2^m) is prime if there exists b such that b^((p-1)/2) == -1 (mod n). This sequence lists the smallest b which certifies primality of A080076(n) via this relation.
For n > 3, a(n) is an odd prime. - Thomas Ordowski, Apr 23 2019
FORMULA
a(n) = A020649(A080076(n)) = A053760(k), where prime(k) = A080076(n). - Thomas Ordowski, Apr 23 2019
PROG
CROSSREFS
KEYWORD
nonn
AUTHOR
M. F. Hasler, Oct 18 2014
STATUS
approved