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.

A101779 a(n) = least k such that all of k, 2k+1, 3k+2, ..., nk+n-1 are primes, or 0 if no such k is found.

Table of values

n a(n)
1 2
2 2
3 3
4 5
5 5
6 154769
7 2894219
8 2894219
9 407874179
10 214580145779
11 9448481062019
12 247236503934419
13 2545206711847799
14 18178612369988250179
15 53792264108455702829

List of values

[2, 2, 3, 5, 5, 154769, 2894219, 2894219, 407874179, 214580145779, 9448481062019, 247236503934419, 2545206711847799, 18178612369988250179, 53792264108455702829]