On Sat, 13 Sep 2003, Yuval Dekel wrote: > Let R be the polynomial ring GF(2)[x] and > a(n) = Number of distinct products f*g with f,g in R and 1 <= deg(f),deg(g) > <= n . > > Can someone compute a(n) ? Here are the values I get for n from 1 to 8: 3, 18, 72, 262, 975, 3562, 13456, 50765 --Edwin