A096281 - OEIS

%I #7 Nov 21 2013 12:48:20

%S 8,10,12,18,24,30,36,48,60,72,84,102,120,132,144,174,204,210,216,246,

%T 276,288,300,330,360,372,384,390,396,426,456,468,480,510,540,552,564,

%U 594,624,660,696,768,840,852,864,894,924

%N Sums of successive twin primes of order 1.

%C Order here refers to the depth of the iterations in successive sums. Order 0 is the twin primes, order 1 is the sums of order 0, order 2 is the sums of order 1 etc.

%H Harvey P. Dale, <a href="/A096281/b096281.txt">Table of n, a(n) for n = 1..1000</a>

%e The twin prime quartet 3,5,5,7 has sums 8,10,12 the first three terms in the sequence.

%t Total/@Partition[Flatten[Select[Partition[Prime[Range[120]],2,1], Last[#]- First[#]==2&]],2,1] (* _Harvey P. Dale_, Mar 24 2012 *)

%o (PARI) \Sums of successive twin primes sucsumstw(n,m) = { local(a,b,i,j,k,p); a = vector(1001); b = vector(1001); p=1; forprime(j=3,n, if(isprime(j+2), a[p] = j; a[p+1] = j+2; p+=2; ) ); for(i=1,m, for(j=1,n+n, b[j] = a[j]+ a[j+1]; ); a=b; ); for(k=1,p-2, print1(a[k]","); ) }

%K easy,nice,nonn

%O 1,1

%A _Cino Hilliard_, Jun 23 2004