%I A091257
%S A091257 1,2,2,3,4,3,4,6,6,4,5,8,5,8,5,6,10,12,12,10,6,7,12,15,16,15,12,7,8,14,
%T A091257 10,20,20,10,14,8,9,16,9,24,17,24,9,16,9,10,18,24,28,30,30,28,24,18,10,
%U A091257 11,20,27,32,27,20,27,32,27,20,11,12,22,30,36,40,18,18,40,36,30
%N A091257 Multiplication table A x B computed for polynomials over GF(2), where 
               (A,B) runs as (1,1),(1,2),(2,1),(1,3),(2,2),(3,1),...
%C A091257 Essentially same as A048720 but computed starting from offset one instead 
               of zero. Analogous to A003991. Each n occurs A091220(n) times.
%H A091257 A. Karttunen, <a href="a091247.scm.txt">Scheme-program for computing 
               this sequence.</a>
%H A091257 <a href="Sindx_Ge.html#GF2X">Index entries for sequences operating on 
               GF(2)[X]-polynomials</a>
%Y A091257 a(n) = A048720bi(A091255(n), A091256(n)) because the identity A x B = 
               GCD(A, B) x LCM(A, B) holds also in the polynomial ring GF(2)[X].
%Y A091257 Sequence in context: A132919 A162619 A032355 this_sequence A003991 A131923 
               A119457
%Y A091257 Adjacent sequences: A091254 A091255 A091256 this_sequence A091258 A091259 
               A091260
%K A091257 nonn,tabl
%O A091257 1,2
%A A091257 Antti Karttunen (His-Firstname.His-Surname(AT)iki.fi), Jan 03 2004