%I #10 Feb 17 2019 08:53:17

%S 31,11,313,23,163,53,157,43,41,71,103,137,61,127,193,227,113,109,107,

%T 101,277,127,101,223,113,181,251,571,233,409,151,257,211,317,491,557,

%U 733,367,433,359,313,491,271,233,509,281,241,311,271,373,1163,613,571

%N Primes q from A178548.

%C See comments in A178548.

%H G. C. Greubel, <a href="/A178561/b178561.txt">Table of n, a(n) for n = 1..10000</a>

%H G. C. Greubel, <a href="/A178561/a178561.txt">List of triples (prime(n+2), p=A178548(n), q=A178561(n)) for n=0..100</a>

%e From _Robert G. Wilson v_, Aug 23 2010: (Start)

%e 2*13 + prime(3) = 26 + 5 = 31 = prime(11), digsum(13)=digsum(31)=4

%e 2*2 + prime(4) = 4 + 7 = 11 = prime(5), digsum(2)=digsum(11)=2

%e 2*151 + prime(5) = 302 + 11 = 313 = prime(65), digsum(151)=digsum(313)=7

%e 2*5 + prime(6) = 10 + 13 = 23 = prime(9), digsum(5)=digsum(23)=5, etc.

%e (End)

%t f[n_] := Block[{p = 2}, While[q = 2 p + Prime[n + 2]; !PrimeQ@q || Plus @@ IntegerDigits@p != Plus @@ IntegerDigits@q, p = NextPrime@p]; q]; Array[f, 53] (* _Robert G. Wilson v_, Aug 23 2010 *)

%o (PARI) a(n) = {my(p=2, q=prime(n+2)+2*p); while ((!isprime(q) || (sumdigits(p) != sumdigits(q))), p = nextprime(p+1); q = prime(n+2) + 2*p); q; }

%o vector(70, n, a(n)) \\ _G. C. Greubel_ and _Michel Marcus_, Feb 26 2019

%Y Cf. A000040, A001358, A178548.

%K base,nonn

%O 1,1

%A Ulrich Krug (leuchtfeuer37(AT)gmx.de), May 29 2010

%E All comments removed by _Robert G. Wilson v_, Aug 23 2010

%E a(37) corrected by _G. C. Greubel_, Feb 16 2019