id:A091228 - OEIS Search Results

Search: id:A091228

Displaying 1-1 of 1 results found.

page 1

Smallest m >= n, such that m is irreducible when interpreted as GF(2)[X]-polynomial.

+0
2

2, 2, 2, 3, 7, 7, 7, 7, 11, 11, 11, 11, 13, 13, 19, 19, 19, 19, 19, 19, 25, 25, 25, 25, 25, 25, 31, 31, 31, 31, 31, 31, 37, 37, 37, 37, 37, 37, 41, 41, 41, 41, 47, 47, 47, 47, 47, 47, 55, 55, 55, 55, 55, 55, 55, 55, 59, 59, 59, 59, 61, 61, 67, 67, 67, 67, 67, 67, 73, 73, 73 (list; graph; listen)

	OFFSET	`0,1`
	COMMENT	`Analogous to A007918.`
	LINKS	`A. Karttunen, Scheme-program for computing this sequence.` `Index entries for sequences operating on GF(2)[X]-polynomials`
	FORMULA	`a(n) = n + A091229(n).`
	CROSSREFS	`Sequence in context: A125721 A049798 A024682 this_sequence A134890 A101360 A110910` `Adjacent sequences: A091225 A091226 A091227 this_sequence A091229 A091230 A091231`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen (His-Firstname.His-Surname(AT)iki.fi), Jan 03 2004`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research