id:A091257 - OEIS Search Results

Search: id:A091257

Displaying 1-1 of 1 results found.

page 1

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),...

+0
5

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, 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, 11, 20, 27, 32, 27, 20, 27, 32, 27, 20, 11, 12, 22, 30, 36, 40, 18, 18, 40, 36, 30 (list; table; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Essentially same as A048720 but computed starting from offset one instead of zero. Analogous to A003991. Each n occurs A091220(n) times.`
	LINKS	`A. Karttunen, Scheme-program for computing this sequence.` `Index entries for sequences operating on GF(2)[X]-polynomials`
	CROSSREFS	`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].` `Sequence in context: A132919 A162619 A032355 this_sequence A003991 A131923 A119457` `Adjacent sequences: A091254 A091255 A091256 this_sequence A091258 A091259 A091260`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Antti Karttunen (His-Firstname.His-Surname(AT)iki.fi), Jan 03 2004`

page 1

Search completed in 0.002 seconds

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.

AT&T Labs Research