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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A260826 Let f(k)=2*k^2+11. For n=0,1,...,11, a(n) = smallest m >= 0 such that f(m-1) is composite if m>0, f(m), f(m+1), ...,f(m+n-1) are prime, and f(m+n) is composite. 0
 11, 13, 15, 18, 28, 578, 617, 2067795, 843755046, 134239787815, 1434279786435, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Sequence is complete, a(9) and a(10) are due to Giovanni Resta. LINKS Table of n, a(n) for n=0..11. Eric Weisstein's World of Mathematics, Prime-generating Polynomial. EXAMPLE Note that f(0), f(1), ..., f(10) are prime, while f(11) and f(12) are composite. So a(0)=11 and a(11)=0. CROSSREFS Cf. A050265, A092968. Sequence in context: A277694 A179084 A124569 * A289699 A049722 A099481 Adjacent sequences: A260823 A260824 A260825 * A260827 A260828 A260829 KEYWORD nonn,fini,full AUTHOR Giovanni Resta and Zak Seidov, Aug 01 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 April 15 04:34 EDT 2024. Contains 371667 sequences. (Running on oeis4.)