I've a summation-method based on the triangle of Eulerian-numbers, (just for reference:
$\qquad \qquad \tiny \begin{array} {rrrrr} 1 & . & . & . & . & . \\ 1 & 0 & . & . & . & . \\ 1 & 1 & 0 & . & . & . \\ 1 & 4 & 1 & 0 & . & . \\ 1 & 11 & 11 & 1 & 0 & . \\ 1 & 26 & 66 & 26 & 1 & 0 \\ ... & ... & ... \end{array}$

Call this (infinite) matrix E. The row-sums are the factorials and scaling the rows by the reciprocal factorials make the rowsums the unit; actually we can construct a regular matrix-summation method on this. We use the column-sums of E, more precisely the dot-products of the infinite vector containg our primes with alternating signs and the reciprocal factorials (call it X)

$\qquad \qquad \small X=\text{ [ 2 , -3 , 5/2! , -7/3! , 11/4! , -13/5! , 17/6! , -19/7! , ... ]}$

with E in a resulting vector T, which contains then the sequence of the Eulerian-transforms

$\qquad \qquad \small X * E = T$

as instance of an "Eulerian transformation" (as different to the other name of "Euler-transformation" which uses the pascalmatrix instead). Finally the sum of the entries in T is the acceptable value for the alternating sum of the primes under "Eulerian summation", if this sum converges. We want finally write, using the lower triangular matrix of ones D for the partial sums in the vector S :

$\qquad \qquad \small D * T^{\tiny \text{ T}} = S$

and if the sequence of entries in S converges, then $s =\lim_{n\to \infty} s_n$ will be our limit for the alternating sum of primes.

Because of the reciprocal factorial which is involved in the dotproducts, because of the little growthrate of the sequence of primenumbers and because of the simple composition of the eulerian numbers each of that columnwise dotproduct occuring in the multiplication $X *E$ is convergent, so each entry in T is well defined. Here are the first couple entries of T:

$\qquad \qquad \small T = \text{[ 0.7036728 , 1.059633 , 0.9470500 , 0.006954269 , -0.9466667 , -0.6131519 , 0.1756172, 0.5145809,... ]}$

and the partial sums from T show a nicer behave than that of the sequence of alternating signed primes. However, this is still not conclusive - maybe with some more terms (I computed this up to n=127) one can give a more conclusive result. Here is a plot of the entries in T

It impresses me, that this Eulerian transforms are all of small absolute value, and this let's me hope, that we might be on the right track here. On the other hand, in the following plot of the partial sums, the (directly summed) partial sums still show oscillating behave (its summands still having alternating signs), so I've also included three variants using additional Eulersums of small orders (0.2,1 and 2) to hopefully flatten that oscillating curves down to convergence.

However these Eulersums still does not suffice to arrive at a convergent sequence of partial sums - at least not with 128 terms only, perhaps we should look up to 256 terms or more.

[update]: After optimizing the procedures I've got the first 256 partial sums of the T-vector:

(Well, from the pictures I begin to suspect that we need still another method, possibly fourier-series or even a completely different approach.)

[update]: to answer on Greg's comment I compared the profile of partial sums of that summation using the Eulerian numbers and that of the common, ordinary Euler-summation. Surprise: the profile is nearly identical, only that the method using Eulerian summation arrives at the same profile using only the forth part of coefficients:

I've a summation-method based on the triangle of Eulerian-numbers, (just for reference:
$\qquad \qquad \tiny \begin{array} {rrrrr} 1 & . & . & . & . & . \\ 1 & 0 & . & . & . & . \\ 1 & 1 & 0 & . & . & . \\ 1 & 4 & 1 & 0 & . & . \\ 1 & 11 & 11 & 1 & 0 & . \\ 1 & 26 & 66 & 26 & 1 & 0 \\ ... & ... & ... \end{array}$

Call this (infinite) matrix E. The row-sums are the factorials and scaling the rows by the reciprocal factorials make the rowsums the unit; actually we can construct a regular matrix-summation method on this. We use the column-sums of E, more precisely the dot-products of the infinite vector containg our primes with alternating signs and the reciprocal factorials (call it X)

$\qquad \qquad \small X=\text{ [ 2 , -3 , 5/2! , -7/3! , 11/4! , -13/5! , 17/6! , -19/7! , ... ]}$

with E in a resulting vector T, which contains then the sequence of the Eulerian-transforms

$\qquad \qquad \small X * E = T$

as instance of an "Eulerian transformation" (as different to the other name of "Euler-transformation" which uses the pascalmatrix instead). Finally the sum of the entries in T is the acceptable value for the alternating sum of the primes under "Eulerian summation", if this sum converges. We want finally write, using the lower triangular matrix of ones D for the partial sums in the vector S :

$\qquad \qquad \small D * T^{\tiny \text{ T}} = S$

and if the sequence of entries in S converges, then $s =\lim_{n\to \infty} s_n$ will be our limit for the alternating sum of primes.

Because of the reciprocal factorial which is involved in the dotproducts, because of the little growthrate of the sequence of primenumbers and because of the simple composition of the eulerian numbers each of that columnwise dotproduct occuring in the multiplication $X *E$ is convergent, so each entry in T is well defined. Here are the first couple entries of T:

$\qquad \qquad \small T = \text{[ 0.7036728 , 1.059633 , 0.9470500 , 0.006954269 , -0.9466667 , -0.6131519 , 0.1756172, 0.5145809,... ]}$

and the partial sums from T show a nicer behave than that of the sequence of alternating signed primes. However, this is still not conclusive - maybe with some more terms (I computed this up to n=127) one can give a more conclusive result. Here is a plot of the entries in T

It impresses me, that this Eulerian transforms are all of small absolute value, and this let's me hope, that we might be on the right track here. On the other hand, in the following plot of the partial sums, the (directly summed) partial sums still show oscillating behave (its summands still having alternating signs), so I've also included three variants using additional Eulersums of small orders (0.2,1 and 2) to hopefully flatten that oscillating curves down to convergence.

However these Eulersums still does not suffice to arrive at a convergent sequence of partial sums - at least not with 128 terms only, perhaps we should look up to 256 terms or more.

[update]: After optimizing the procedures I've got the first 256 partial sums of the T-vector:

(Well, from the pictures I begin to suspect that we need still another method, possibly fourier-series or even a completely different approach.)

3 typos

I've a summation-method based on the triangle of Eulerian-numbers, (just for reference:
$\qquad \qquad \tiny \begin{array} {rrrrr} 1 & . & . & . & . & . \\ 1 & 0 & . & . & . & . \\ 1 & 1 & 0 & . & . & . \\ 1 & 4 & 1 & 0 & . & . \\ 1 & 11 & 11 & 1 & 0 & . \\ 1 & 26 & 66 & 26 & 1 & 0 \\ ... & ... & ... \end{array}$

Call this (infinite) matrix E. The row-sums are the factorials and scaling the rows by the reciprocal factorials make the rowsums the unit; actually we can construct a regular matrix-summation method on this. We use the column-sums of E, more precisely the dot-products of the infinite vector containg our primes with alternating signs and the reciprocal factorials (call it X)

$\qquad \qquad \small X=\text{ [ 2 , -3 , 5/2! , -7/3! , 11/4! , -13/5! , 17/6! , -19/7! , ... ]}$

with E in a resulting vector T, which contains then the sequence of the Eulerian-transforms

$\qquad \qquad \small X * E = T$

as instance of an "Eulerian transformation" (as different to the other name of "Euler-transformation" which uses the pascalmatrix instead). Finally the sum of the entries in T is the acceptable value for the alternating sum of the primes under "Eulerian summation", if this sum converges. We want finally write, using the lower triangular matrix of ones D for the partial sums in the vector S :

$\qquad \qquad \small D * T^{\tiny \text{ T}} = S$

and if the sequence of entries in S converges, then $s =\lim_{n\to \infty} s_n$ will be our limit for the alternating sum of primes.

Because of the reciprocal factorial which is involved in the dotproducts, because of the little growthrate of the sequence of primenumbers and because of the simple composition of the eulerian numbers each of that columnwise dotproduct occuring in the multiplication $X *E$ is convergent, so each entry in T is well defined. Here are the first couple entries of T:

$\qquad \qquad \small T = \text{[ 0.7036728 , 1.059633 , 0.9470500 , 0.006954269 , -0.9466667 , -0.6131519 , 0.1756172, 0.5145809,... ]}$

and the partial sums from T show a nicer behave than that of the sequence of alternating signed primes. However, this is still not conclusive - maybe with some more terms (I computed this up to n=63n=127) one can give a more conclusive result. Here is a plot of the entries in T

It impresses me, that this Eulerian transforms are all of small absolute value, and this let's me hope, that we might be on the right track here. On the other hand, in the following plot of the partial sums, the (directly summed) partial sums still show oscillating behave (its summands even still having alternating signs), so I've also included two three variants using additional Eulersums of small orders (0.2 0.2,1 and 12) to hopefully flatten that oscillating curves down to convergence.

However these Eulersums still does not suffice to arrive at a convergent sequence of partial sums - at least not with 64 128 terms only, perhaps we should look up to 256 terms or more.

(Well, from the pictures I begin to suspect that we need still another method, possibly fourier-series or even a completely different approach.)

2 explanation improved
1