The OEIS is supported by the many generous donors to the OEIS 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A257979 Smallest prime p for which exactly n primes k with k < p exist such that F_p-(p/k) == 0 (mod p), where F_i = A000045(i) and (a/b) denotes the Legendre symbol, or 0 if no such p exists. 1
 2, 3, 11, 19, 13, 31, 47, 43, 37 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Smallest p = prime(x) such that A257978(x) == n. Conjecture: a(9) = 0 (based on observation of the asymptotic behavior of A257978). a(10)-a(16) are 59, 71, 101, 97, 139, 127, 149. LINKS PROG (PARI) for(n=0, 10, forprime(p=2, , i=0; forprime(k=2, p, if(Mod(fibonacci(p-kronecker(p, k)), p)==0, i++)); if(i==n, print1(p, ", "); break({1})))) CROSSREFS Cf. A257978. Sequence in context: A024861 A025101 A025105 * A095984 A229550 A172258 Adjacent sequences: A257976 A257977 A257978 * A257980 A257981 A257982 KEYWORD nonn,more AUTHOR Felix Fröhlich, May 15 2015 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.

Last modified December 6 21:00 EST 2022. Contains 358648 sequences. (Running on oeis4.)