login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A091228 Smallest m >= n, such that m is irreducible when interpreted as GF(2)[X]-polynomial. 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; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

Analogous to A007918.

LINKS

Table of n, a(n) for n=0..70.

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: A165198 A245526 A024682 * A181056 A200918 A134890

Adjacent sequences:  A091225 A091226 A091227 * A091229 A091230 A091231

KEYWORD

nonn

AUTHOR

Antti Karttunen, Jan 03 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 03:31 EST 2020. Contains 338943 sequences. (Running on oeis4.)