A070853 Smallest prime == 1 mod (9n).
19, 19, 109, 37, 181, 109, 127, 73, 163, 181, 199, 109, 937, 127, 271, 433, 307, 163, 2053, 181, 379, 199, 829, 433, 1801, 937, 487, 757, 523, 271, 1117, 577, 1783, 307, 631, 1297, 1999, 2053, 3511, 1801, 739, 379, 1549, 397, 811, 829, 1693, 433, 883
Offset: 1
Keywords
Links
- Robert Price, Table of n, a(n) for n = 1..5000
Programs
-
PARI
for(n=1,80,s=1; while((isprime(s)*s-1)%(9*n)>0,s++); print1(s,","))
Extensions
Corrected and extended by Benoit Cloitre, May 18 2002