Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #9 Jul 02 2018 07:03:24
%S 0,1,1,0,0,0,1,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,
%T 0,0,1,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,
%U 0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0
%N a(n) = 1 if n is a prime whose binary expansion encodes a (0,1)-polynomial which is irreducible when factored over GF(2), 0 otherwise.
%C Characteristic function of A091206.
%H Antti Karttunen, <a href="/A305816/b305816.txt">Table of n, a(n) for n = 1..65537</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>
%F a(n) = A010051(n)*A091225(n).
%F a(n) = [A305789(n) == 2].
%o (PARI) A305816(n) = (isprime(n)&&polisirreducible(Pol(binary(n))*Mod(1,2)));
%Y Cf. A091206, A305802, A305789, A305817 (partial sums), A305904.
%K nonn
%O 1
%A _Antti Karttunen_, Jun 15 2018