<HTML><BODY><DIV style='font-family: "Verdana"; font-size: 10pt;'><DIV>
<DIV>I have recently encountered a transformation several times that I have never seen described. It basically takes a sequence a, where a(n) is the number of objects (of some type) of size n, and produces the sequence of the number of unordered pairs of such objects. The formula is:</DIV>
<DIV> </DIV>
<DIV>b(2n) = C(b(n)+1,2) + sum_{k=0}^{n-1} a(k)*a(2n-k), b(2n+1)=sum_{k=0}^n a(k)*a(2n+1-k).</DIV>
<DIV> </DIV>
<DIV>I'm calling this the convolution semi-square, because it is (in some sense) half the summation for the convolution square.</DIV>
<DIV> </DIV>
<DIV>Has anyone identified and named this transformation before? Should it be included in the transformations page?</DIV>
<DIV> </DIV>
<DIV>Franklin T. Adams-Watters<BR>16 W. Michigan Ave.<BR>Palatine, IL 60067<BR>847-776-7645</DIV></DIV></DIV>
<hr style="MARGIN-TOP:10px" >
<b>Try the New Netscape Mail Today!</b><br />
Virtually Spam-Free | More Storage | Import Your Contact List<br /><a href="http://mail.netscape.com">http://mail.netscape.com</a>
</BODY></HTML>