OFFSET
1,1
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..10000
MAPLE
filter:= proc(n)
local a, i, x;
if not isprime(n) then return false fi;
a:= convert(n, base, 2);
not isprime(convert(a, `+`)) and (Irreduc(add(x^(i-1)*a[i], i=1..nops(a))) mod 2)
end proc:
select(filter, [2, 2*j+1$j=1..10000]); # Robert Israel, May 14 2015
MATHEMATICA
okQ[p_?PrimeQ] := Module[{id, pol, x}, id = IntegerDigits[p, 2] // Reverse; pol = id.x^Range[0, Length[id]-1]; IrreduciblePolynomialQ[pol, Modulus -> 2] && !PrimeQ[Count[id, 1]]];
Select[Prime[Range[1000]], okQ] (* Jean-François Alcover, Feb 09 2023 *)
PROG
(PARI)
isA014580(n) = polisirreducible(Pol(binary(n))*Mod(1, 2)); \\ This function from Charles R Greathouse IV
i = 0; forprime(n=2, 2^31, if(isA014580(n)&&!isprime(hammingweight(n)), i++; write("b255569.txt", i, " ", n); if(i>=10000, return(n))));
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved