|
|
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
|
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
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
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Yuval Dekel (dekelyuval(AT)hotmail.com), Sep 13 2003
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|