The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A064229 Smallest prime p associated with A064164(n). 2
 61, 71, 83, 23, 59, 61, 661, 23, 71, 20639383, 439429, 521, 79, 811, 1697, 14557, 1080941, 257, 2281, 50989, 67411, 137, 83, 14029308060317546154181, 57554485363, 59, 70552493296669, 59, 694763, 293, 6007711, 12893, 1021, 149, 71, 24324571, 9293, 12318573951317236818169524329 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Amiram Eldar, Table of n, a(n) for n = 1..120 EXAMPLE 8!+1 = 61*661 and 61 is not 1 mod 8, so the first term is 61. PROG (PARI) choose(n) = {my(f=factor(n!+1)[, 1]); for(i=1, #f, if(f[i]%n != 1, return(f[i]))); 0; } lista(nn) = for(k=1, nn, if(choose(k)>1, print1(choose(k), ", "))); \\ Jinyuan Wang, Oct 03 2019 CROSSREFS Sequence in context: A043213 A043993 A165287 * A180555 A039478 A109549 Adjacent sequences:  A064226 A064227 A064228 * A064230 A064231 A064232 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, Sep 23 2001 EXTENSIONS More terms from Don Reble, Sep 23 2001 STATUS approved

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

Last modified December 9 03:23 EST 2021. Contains 349625 sequences. (Running on oeis4.)