login
Primes equal to a sum of primes with differences congruent to (2,4) mod 6.
3

%I #5 Mar 30 2012 18:40:00

%S 353,41,131,131,311,1181,941,1049,1931,2579,3911,4289,4451,6719,8069,

%T 10391,10589,12011,14369,26591,31379,33521,35339,41081,43889,58271,

%U 59981,63059,64679,66821,115331,74759,77999,78791,80051,80141,83219,87071,94541,96179

%N Primes equal to a sum of primes with differences congruent to (2,4) mod 6.

%C Consider finite ordered subsequences of at least 2 distinct primes A000040 subject to the conditions:

%C (i) the first differences of the subsequence are the initial terms of A047235,

%C (ii) the sum of the terms of the subsequence is a prime,

%C (iii) the subsequence is maximum in the sense that it cannot be extended by appending larger primes and still maintaining the conditions (i) and (ii).

%C Then the (prime) sum of the subsequence is one term of this sequence here.

%C The terms are inserted in order of the smallest prime in the subsequence.

%e a(1)=353 because 353 = 5+7+11+19+29+43+59+79+101.

%e a(2)=41 because 41 = 11+13+17.

%e a(3)=131 because 131 = 17+19+23+31+41.

%e a(4)=131 because 131 = 41+43+47.

%e a(5)=311 because 311 = 101+103+107.

%K nonn,less

%O 1,1

%A _Giovanni Teofilatto_, Mar 10 2005

%E 41 inserted, 131 duplicated, 311 inserted and sequence extended and comment added by _R. J. Mathar_, Apr 23 2010