The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A035091 Smallest prime == 1 mod (n^2). 2
2, 5, 19, 17, 101, 37, 197, 193, 163, 101, 727, 433, 677, 197, 1801, 257, 3469, 1297, 10831, 401, 883, 1453, 12697, 577, 11251, 677, 1459, 3137, 10093, 1801, 15377, 12289, 2179, 3469, 7351, 1297, 5477, 18773, 9127, 1601, 16811, 3529, 22189, 11617 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Smallest prime of form (n^2)*k+1, i.e., an arithmetic progression with n^2 differences; k is the subscript of the progressions.
LINKS
EXAMPLE
a(5)=101 because in 5^2k + 1 = 25k + 1 progression k=4 generates the smallest prime (this is 101) and 26, 51, and 76 are composite.
MATHEMATICA
With[{prs=Prime[Range[2500]]}, Flatten[Table[Select[prs, Mod[#-1, n^2]==0&, 1], {n, 50}]]] (* Harvey P. Dale, Sep 22 2021 *)
CROSSREFS
Analogous case is A034694. Special case is A002496.
Sequence in context: A323706 A125765 A068873 * A045367 A045368 A215426
KEYWORD
nonn
AUTHOR
STATUS
approved

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 June 13 00:51 EDT 2024. Contains 373362 sequences. (Running on oeis4.)