cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Original entry on oeis.org

11, 13, 15, 18, 28, 578, 617, 2067795, 843755046, 134239787815, 1434279786435, 0
Offset: 0

Views

Author

Giovanni Resta and Zak Seidov, Aug 01 2015

Keywords

Comments

Sequence is complete, a(9) and a(10) are due to Giovanni Resta.

Examples

			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