Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #9 Oct 19 2017 03:14:36
%S 5,35,455,8645,267995,11523785,702950885,51315414605,5285487704315,
%T 576118159770335,80080424208076565,12092144055419561315,
%U 2188678074030940598015,422414868287971535416895
%N a(n) = product of first n terms of A006512.
%t Rest[FoldList[Times,1,Transpose[Select[Partition[Prime[Range[100]],2,1], Last[#]- First[#] == 2&]][[2]]]] (* _Harvey P. Dale_, Nov 02 2011 *)
%o (PARI) fu(n) = p=1;for(x=1,n,p*=twinu(x);print1(p",")) \The n-th upper twin prime twinu(n) = { local(c,x); c=0; x=1; while(c<n, if(isprime(prime(x)+2),c++); x++; ); return(prime(x)) }
%Y Cf. A006512, A097489.
%K nonn
%O 1,1
%A _Cino Hilliard_, Aug 24 2004
%E Edited by _Don Reble_, Apr 16 2007