login
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
OFFSET
0,1
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
Complementary to A091225. Partial sums give A091245.
Sequence in context: A087101 A000493 A011663 * A085137 A304577 A194670
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jan 03 2004
STATUS
approved