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.

Table of values

n a(n)
0 11
1 13
2 15
3 18
4 28
5 578
6 617
7 2067795
8 843755046
9 134239787815
10 1434279786435
11 0

List of values

[11, 13, 15, 18, 28, 578, 617, 2067795, 843755046, 134239787815, 1434279786435, 0]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.