proposed
approved
proposed
approved
editing
proposed
Robert Israel, <a href="/A077718/b077718.txt">Table of n, a(n) for n = 1..10000</a>
f:= proc(n) local L, x;
L:= convert(n, base, 2);
x:= 1+add(L[i]*4^i, i=1..nops(L));
if isprime(x) then x fi
end proc:
map(f, [$1..1000]); # Robert Israel, Sep 06 2018
approved
editing
editing
approved
As a subsequence of primes in A000695, these would could be called Moser-de Bruijn primes. See also A235461 for those numbers terms whose base 4 representation also represents a prime in base 2. - M. F. Hasler, Jan 11 2014
(PARI) for(i=1, 999, isprime(b=vector(#b=binary(i), j, 4^(#b-j))*b~)&&print1(b", ")) \\ - M. F. Hasler, Jan 12 2014
As a subsequence of primes in A000695, these would be called Moser-de Bruijn primes. See also A235461 for those numbers whose base 4 representation also represents a prime in base 2. - M. F. Hasler, Jan 11 2014
approved
editing
_Amarnath Murthy (amarnath_murthy(AT)yahoo.com), _, Nov 19 2002
proposed
approved
editing
proposed
Select[Prime[Range[6650]], Max[Union[IntegerDigits[#, 4]]]<=1&] (* Jayanta Basu, May 22 2013 *)
proposed
editing