Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #25 Mar 14 2021 06:08:51
%S 2,6,21,65,183,543,1587,4685,13935,41708,125479,379317,1150971,
%T 3503790,10695879,32729271,100361001,308313167,948694965
%N The longest length of consecutive primes which sums to prime = A342439(n) < 10^n.
%C Inspired by the 50th problem of Project Euler (see link).
%C The corresponding largest primes obtained are in A342439.
%C Solutions and Python program are proposed in Dreamshire and archive.today links. - _Daniel Suteu_, Mar 12 2021
%H Archive.today, <a href="https://archive.is/cd2SI">trizen / experimental-projects</a>.
%H Dreamshire, <a href="https://blog.dreamshire.com/project-euler-50-solution/">Project Euler 50 Solution</a>.
%H Project Euler, <a href="https://projecteuler.net/problem=50">Problem 50: Consecutive prime sum</a>.
%e A342439(1) = 5 = 2+3, hence a(1) = 2 since there are 2 terms in this longest sum.
%e A342439(2) = 41 = 2 + 3 + 5 + 7 + 11 + 13 hence a(2) = 6 since there are 6 terms in this longest sum.
%Y Cf. A342439, A342443, A342444.
%K nonn,more
%O 1,1
%A _Bernard Schott_, Mar 12 2021
%E a(4)-a(17) from _Daniel Suteu_, Mar 12 2021
%E a(18)-a(19) from _Martin Ehrenstein_, Mar 13 2021