The OEIS is supported by the many generous donors to the OEIS Foundation.

a(n) is the first odd prime greater than a(n-1) such that (a(1), ..., a(n)) forms a prime vector. a(1)=3, a(2)=5.

1

`%I #5 Jun 03 2017 11:15:58
`

`%S 3,5,11,13,29,31,47,61,71,409,2819,4261,113819,124633,236507,250693,
`

`%T 501779,886609,29089889,57721663,157320827,465327091,812828249,
`

`%U 1530361321
`

`%N a(n) is the first odd prime greater than a(n-1) such that (a(1), ..., a(n)) forms a prime vector. a(1)=3, a(2)=5.
`

`%C A prime vector of order n is an array of n distinct primes P = (p_1, p_2, ..., p_n) such that every sum of an odd number of consecutive elements is also prime. The weight of the prime vector is the sum of its elements. For full details see the Kamenetsky paper.
`

`%C a(1)-a(24) were found by Herbert Kociemba.
`

`%H Dmitry Kamenetsky, <a href="https://arxiv.org/abs/1703.06778">Prime sums of primes</a>, arXiv:1703.06778 [math.HO], 2017.
`

`%H Carlos Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_875.htm">Puzzle 875: Vector of primes that generates distinct primes</a>
`

`%Y Cf. A286263, A287939.
`

`%K nonn,more
`

`%O 1,1
`

`%A _Dmitry Kamenetsky_, Jun 03 2017
`