The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 1
 3, 18, 72, 262, 975, 3562, 13456, 50765, 194122, 745526, 2882670, 11173191, 43485970, 169656399, 663259282, 2598327983, 10190686903, 40038932993, 157431481559, 619871680780, 2442107519364, 9632769554849, 38008189079970, 150127212826428, 593141913076502 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS W. Edwin Clark computed the initial terms. LINKS Table of n, a(n) for n=1..25. FORMULA a(n) = A086908(n) - 1 - Sum_{i=0, n} A001037(i). - Andrew Howroyd, Jul 10 2018 EXAMPLE From Andrew Howroyd, Jul 10 2018: (Start) Case n=1: The following 3 polynomials can be represented: x^2 = x*x, x^2 + 1 = (x + 1)*(x+1), x^2 + x = x*(x + 1). (End) CROSSREFS Cf. A001037, A027424, A086908. Sequence in context: A174764 A114633 A135070 * A305623 A280804 A152897 Adjacent sequences: A073958 A073959 A073960 * A073962 A073963 A073964 KEYWORD nonn AUTHOR Yuval Dekel (dekelyuval(AT)hotmail.com), Sep 13 2003 EXTENSIONS a(9)-a(25) from Andrew Howroyd, Jul 10 2018 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 27 14:11 EDT 2023. Contains 365711 sequences. (Running on oeis4.)