Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073961
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
2
3, 18, 72, 262, 975, 3562, 13456, 50765 (list; graph; listen)
OFFSET

1,1

COMMENT

Edwin Clark (eclark(AT)math.usf.edu) computed the numbers.

CROSSREFS

Cf. A027424.

Sequence in context: A098522 A114633 A135070 this_sequence A059393 A094033 A043008

Adjacent sequences: A073958 A073959 A073960 this_sequence A073962 A073963 A073964

KEYWORD

nonn

AUTHOR

Yuval Dekel (dekelyuval(AT)hotmail.com), Sep 13 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research