<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META http-equiv=Content-Type content="text/html; charset=iso-8859-1">
<META content="MSHTML 6.00.2900.2963" name=GENERATOR>
<STYLE></STYLE>
</HEAD>
<BODY bgColor=#ffffff>
<DIV><FONT face=Arial size=2><FONT size=2>
<P>Here are my corrected and cleaned up versions of A088460 and A088463 for the
editors' approval.</P>
<P>I have gotten rid of the "twipls" and "twipus" names. IMHO, unless these
sequences become the center of serious research, the OEIS A-numbers will do.</P>
<P>I have reindexed the sequences starting at 1. This seems to be the natural
indexing for these sequences, especially in light of the formulae.</P>
<P>I have added formulas.</P>
<P>I have replaced voluminous comments with shorter ones that are effectively
equivalent.</P>
<P>%I A088460</P>
<P>%S A088460
11,29,137,239,641,1151,1931,2339,3851,4091,5639,6359,8231,9011,9431,</P>
<P>%T A088460
11351,12161,14561,15731,17837,20441,25931,26951,29207,33767,37781,40847,</P>
<P>%U A088460
42407,44381,46439,59471,60917,61979,65171,67427,80831,81929,83339</P>
<P>%N A088460 Lower twin primes of lower twin prime index</P>
<P>%F A088460 A001359(A001359(n))</P>
<P>%C A088460 a(n) == 5 (mod 6)</P>
<P>%o A088460 (PARI) a(k) = { for(x1=1,k, print1(twinl(twinl(x1))",") ) }
twinl(n) = { c=0; x=1; while(c<n, if(isprime(prime(x)+2),c++); x++; );
return(prime(x-1)) }</P>
<P>%Y A088460 A001359</P>
<P>%K A088460 nonn,uned</P>
<P>%O A088460 1,1</P>
<P>%A A088460 Cino Hilliard (hillcino368(AT)hotmail.com), Nov 12 2003</P>
<P> </P>
<P>%I A088463</P>
<P>%S A088463
31,61,181,283,811,1279,1999,2551,3931,4159,5659,6553,8389,9241,9463,</P>
<P>%T A088463
11551,12253,14629,15889,17923,20509,26113,27109,29401,33829,37993,</P>
<P>%U A088463
41179,42571,44623,46681,59671,61333,62143,65449,67759,81019,82009</P>
<P>%N A088463 Upper twin primes of upper twin prime index</P>
<P>%F A088463 A006512(A006512(n))</P>
<P>%C A088463 a(n) == 1 (mod 6)</P>
<P>%o A088463 (PARI) a(k) = { for(x1=1,k, y1=twinu(twinu(x1)); print1(y1",") ) }
twin(n) = { c=0; x=1; while(c<n, if(isprime(prime(x)+2),c++); x++; );
return(prime(x)) }</P>
<P>%Y A088460 A001359</P>
<P>%K A088463 nonn,uned</P>
<P>%O A088463 1,1</P>
<P>%A A088463 Cino Hilliard (hillcino368(AT)hotmail.com), Nov 12
2003</P></FONT></FONT></DIV></BODY></HTML>