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.

A342453 When A342439(n) is the largest prime < 10^n obtained with the longest sum of the A342440(n) consecutive primes, then a(n) is the first prime of these A342440(n) consecutive primes.

Original entry on oeis.org

2, 2, 7, 3, 3, 7, 7, 7, 11, 2, 19, 5, 5, 2, 13, 5, 5, 7, 11
Offset: 1

Views

Author

Bernard Schott, Mar 14 2021

Keywords

Comments

Inspired by the 50th problem of Project Euler (see link).
There must be at least two consecutive primes in the sum.
The terms a(4)-a(17) come from the Perl program and the results proposed by Daniel Suteu in the link Archive.today.

Examples

			A342439(2) = 41 = 2 + 3 + 5 + 7 + 11 + 13 hence a(2) = 2.
		

Crossrefs

Extensions

a(4)-a(17) from Daniel Suteu, Mar 14 2021
a(18)-a(19) from Martin Ehrenstein, Mar 14 2021
a(7) and a(15) corrected by Martin Ehrenstein, Mar 14 2021