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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A091247 Characteristic function of A091242: 1 if the n-th GF(2)[X] polynomial is reducible, 0 otherwise. 78
 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS A. Karttunen, Scheme-program for computing this sequence. FORMULA a(n) = A066247(A091203(n)) = A066247(A091205(n)). PROG (PARI) a(n) = if (n<2, 0, ! polisirreducible(Mod(1, 2)*Pol(binary(n)))); \\ Michel Marcus, Apr 12 2015 CROSSREFS Cf. A066247, A091203, A091205, A091246. Complementary to A091225. Partial sums give A091245. Sequence in context: A087101 A000493 A011663 * A085137 A304577 A194670 Adjacent sequences:  A091244 A091245 A091246 * A091248 A091249 A091250 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.

Last modified August 8 19:29 EDT 2020. Contains 336298 sequences. (Running on oeis4.)