This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A080698 #14 Apr 10 2019 14:33:32
%S A080698 15,55,341,1003,3161,7339,16343,25063,55247,62809,105901,127991,
%T A080698 190277,220223,236597,325291,358261,463487,512263,641593,812327,
%U A080698 1213843,1293431,1502399,1944893,2351677,2633803,2806733,3050519,3250847
%N A080698 Product of twin-prime-indexed primes and their lower bound twin prime.
%H A080698 Harvey P. Dale, <a href="/A080698/b080698.txt">Table of n, a(n) for n = 1..1000</a>
%F A080698 Let prime(i) = i-th prime, let twin(n) = (P, Q) be n-th pair of twin primes; sequence gives prime(P)*P.
%e A080698 The 3rd pair of twin primes is twin(3) = (11,13), prime(11) = 31. a(3) = 31*11 = 341.
%t A080698 # Prime[#]&/@Select[Partition[Prime[Range[200]],2,1],#[[2]]-#[[1]]==2&][[All,1]] (* _Harvey P. Dale_, Apr 10 2019 *)
%o A080698 (PARI) twipxpindex(n) = {sr=0; pr=1; for(x=1,n, p1=prime(x); p2=prime(x+1); if((p2-p1)==2, pr=p1*prime(prime(x)); sr+=1.0/pr; print1(pr" ")); ); print(); print(sr) }
%Y A080698 Cf. A057470.
%K A080698 easy,nonn
%O A080698 1,1
%A A080698 _Cino Hilliard_, Mar 04 2003