login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070852 Smallest prime == 1 mod (8n). 9

%I #12 Dec 17 2023 11:34:50

%S 17,17,73,97,41,97,113,193,73,241,89,97,313,113,241,257,137,433,457,

%T 641,337,353,1289,193,401,1249,433,449,233,241,1489,257,1321,1361,281,

%U 577,593,1217,313,641,2297,337,1033,353,1801,3313,1129,769,3137,401

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

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

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

%Y Cf. A070846 to A070851 and A070853.

%Y Cf. A034694.

%K nonn

%O 1,1

%A _Amarnath Murthy_, May 15 2002

%E More terms from _Benoit Cloitre_, May 18 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 13:58 EDT 2024. Contains 371960 sequences. (Running on oeis4.)