%I #16 Feb 08 2023 17:38:03
%S 1,2,4,5,6,8,11,12,13,15,17,18,19,21,25,27,29,32,33,37,39,43,44,47,50,
%T 52,53,61,65,75,78,81,84,90,93,95,102,103,107,110,111,112,113,115,118,
%U 121,123,126,128,134,135,136,138,144,149,151,153,156,158,162,163,164
%N Indices of primes that are also irreducible GF(2)[X]-polynomials.
%H Robert Israel, <a href="/A091207/b091207.txt">Table of n, a(n) for n = 1..10000</a>
%H Antti Karttunen, <a href="/A091247/a091247.scm.txt">Scheme-program for computing this sequence</a>.
%F a(n) = A049084(A091206(n)).
%p filter:= proc(p) local L,i,x;
%p L:= convert(p,base,2);
%p Irreduc(add(L[i]*x^(i-1),i=1..nops(L))) mod 2
%p end proc:
%p select(t -> filter(ithprime(t)), [$1..300]); # _Robert Israel_, Jun 12 2018
%t okQ[p_] := PrimeQ[p] && Module[{id, pol}, id = IntegerDigits[p, 2] // Reverse; pol = id.x^Range[0, Length[id] - 1]; IrreduciblePolynomialQ[pol, Modulus -> 2]];
%t Select[Range[300], okQ[Prime[#]]&] (* _Jean-François Alcover_, Feb 07 2023 *)
%o (PARI) isok(n) = polisirreducible(Mod(1, 2)*Pol(binary(prime(n)))); \\ _Michel Marcus_, Jun 13 2018
%Y Cf. A049084, A091206.
%Y Complement of A091210.
%K nonn
%O 1,2
%A _Antti Karttunen_, Jan 03 2004