Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086908
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A086908
%S A086908 7,23,79,272,991,3587,13499,50838
%N A086908 Let R be the polynomial ring GF(2)[x]. Then a(n) = number of distinct 
               products f*g with f,g in R and 0 <= deg(f),deg(g) <= n.
%Y A086908 Cf. A073961.
%Y A086908 Sequence in context: A048539 A018886 A145842 this_sequence A093069 A091514 
               A003540
%Y A086908 Adjacent sequences: A086905 A086906 A086907 this_sequence A086909 A086910 
               A086911
%K A086908 nonn
%O A086908 1,1
%A A086908 Yuval Dekel (dekelyuval(AT)hotmail.com), Sep 19 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 December 4 15:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research