|
%I #17 Jan 01 2023 12:35:16
%S 0,0,1,1,0,0,0,1,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,
%T 0,0,0,1,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,1,0,1,0,0,0,0,0,1,
%U 0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0
%N Characteristic function of A014580: 1 if the n-th GF(2)[X] polynomial is irreducible, 0 otherwise.
%H Antti Karttunen, <a href="/A091225/b091225.txt">Table of n, a(n) for n = 0..100000</a>
%H A. Karttunen, <a href="/A091247/a091247.scm.txt">Scheme-program for computing this sequence</a>
%H <a href="/index/Ch#char_fns">Index entries for characteristic functions</a>
%H <a href="/index/Ge#GF2X">Index entries for sequences operating on GF(2)[X]-polynomials</a>
%o (PARI) a(n) = polisirreducible(Pol(binary(n))*Mod(1, 2)); \\ _Michel Marcus_, Nov 11 2017
%Y a(n) = A010051(A091203(n)) = A010051(A091205(n)). Partial sums give A091226. Cf. A091227. Complementary to A091247.
%K nonn
%O 0,1
%A _Antti Karttunen_, Jan 03 2004
%E Data section extended up to a(120) by _Antti Karttunen_, Jan 01 2023
|
