The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A305420 Smallest k > n whose binary expansion encodes an irreducible (0,1)-polynomial over GF(2)[X]. 8
 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, 73, 73, 73, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 91 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(n) is the smallest term of A014580 greater than n. LINKS Antti Karttunen, Table of n, a(n) for n = 1..21845 Index entries for sequences related to polynomials in ring GF(2)[X] FORMULA For n >= 1, a(n) = A091228(1+n). PROG (PARI) A091225(n) = polisirreducible(Pol(binary(n))*Mod(1, 2)); A305420(n) = { my(k=1+n); while(!A091225(k), k++); (k); }; CROSSREFS Cf. A014580, A091225, A091228, A305419, A305421. Cf. also A151800, A305430. Sequence in context: A011372 A104955 A011161 * A171464 A276730 A179894 Adjacent sequences: A305417 A305418 A305419 * A305421 A305422 A305423 KEYWORD nonn AUTHOR Antti Karttunen, Jun 07 2018 STATUS approved

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

Last modified March 2 21:56 EST 2024. Contains 370498 sequences. (Running on oeis4.)