Let R be the polynomial ring GF(2)[x]. Then a(n) = number of distinct products f*g with f,g in R and 1 <= deg(f),deg(g) <= n.
A073961
Let R be the polynomial ring GF(2)[x]. Then a(n) = number of distinct products f*g with f,g in R and 1 <= deg(f),deg(g) <= n.
Terms
- a(0) =3a(1) =18a(2) =72a(3) =262a(4) =975a(5) =3562a(6) =13456a(7) =50765a(8) =194122a(9) =745526a(10) =2882670a(11) =11173191a(12) =43485970a(13) =169656399a(14) =663259282a(15) =2598327983a(16) =10190686903a(17) =40038932993a(18) =157431481559a(19) =619871680780
External references
- oeis: A073961