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.

A342440 The longest length of consecutive primes which sums to prime = A342439(n) < 10^n.

Original entry on oeis.org

2, 6, 21, 65, 183, 543, 1587, 4685, 13935, 41708, 125479, 379317, 1150971, 3503790, 10695879, 32729271, 100361001, 308313167, 948694965
Offset: 1

Views

Author

Bernard Schott, Mar 12 2021

Keywords

Comments

Inspired by the 50th problem of Project Euler (see link).
The corresponding largest primes obtained are in A342439.
Solutions and Python program are proposed in Dreamshire and archive.today links. - Daniel Suteu, Mar 12 2021

Examples

			A342439(1) = 5 = 2+3, hence a(1) = 2 since there are 2 terms in this longest sum.
A342439(2) = 41 = 2 + 3 + 5 + 7 + 11 + 13 hence a(2) = 6 since there are 6 terms in this longest sum.
		

Crossrefs

Extensions

a(4)-a(17) from Daniel Suteu, Mar 12 2021
a(18)-a(19) from Martin Ehrenstein, Mar 13 2021