login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Smallest prime == 1 mod (6n).
9

%I #16 Dec 16 2023 18:46:22

%S 7,13,19,73,31,37,43,97,109,61,67,73,79,337,181,97,103,109,229,241,

%T 127,397,139,433,151,157,163,337,349,181,373,193,199,409,211,433,223,

%U 229,937,241,739,757,1033,1321,271,277,283,577,883,601,307,313,3181,1297

%N Smallest prime == 1 mod (6n).

%H Robert Price, <a href="/A070850/b070850.txt">Table of n, a(n) for n = 1..5000</a>

%o (PARI) for(n=1,80,s=1; while((isprime(s)*s-1)%(6*n)>0,s++); print1(s,","))

%Y Cf. A070846, A070847, A070848, A070849, A070851, A070852, A070853.

%Y Cf. A034694.

%K nonn

%O 1,1

%A _Amarnath Murthy_, May 15 2002

%E More terms from _Benoit Cloitre_, May 18 2002