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.

A342444 a(n) is the smallest number of consecutive primes that are necessary to add to obtain the largest prime = A342443(n) < 10^n.

Table of values

n a(n)
1 2
2 3
3 5
4 9
5 5
6 29
7 281
8 1575
9 599
10 7
11 17
12 3
13 6449
14 2725361
15 163315

List of values

[2, 3, 5, 9, 5, 29, 281, 1575, 599, 7, 17, 3, 6449, 2725361, 163315]