OFFSET
1,1
COMMENTS
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
EXAMPLE
53 = 311 (base 4), which contains no 0.
MAPLE
The following code will store the first 200 terms into a sequence K. for i from 1 to 200 do if i=i then x[i]:=convert(ithprime(i), base, 4) else x[i]:=0 end if: end do: S:={}: for i from 1 to 200 do if evalb(`in`(0, x[i]))=false then S:=S union {i} fi od; for i from 1 to nops(S)do z[i]:=ithprime(S[i]) od: K:=[seq((z[i]), i=1..nops(S))];
# Alternative:
select(t -> isprime(t) and not has(convert(t, base, 4), 0), [2, seq(i, i=3..10^4, 2)]); # Robert Israel, Dec 24 2017
MATHEMATICA
Select[Prime@ Range@ 120, DigitCount[#, 4, 0] == 0 &] (* Michael De Vlieger, Dec 24 2017 *)
PROG
(Magma) [ p: p in PrimesUpTo(620) | not exists(t){d: d in Intseq(p, 4) | d eq 0 } ]; // Klaus Brockhaus, Oct 10 2010
(PARI) lista(nn) = forprime(p=2, nn, if(!setsearch(Set(digits(p, 4)), 0), print1(p, ", "))) \\ Iain Fox, Dec 25 2017
CROSSREFS
Cf. A073779 (number of 0's in base-3 representation of n-th prime), A181173 (primes whose base 5 representation does not contain a 0). - Klaus Brockhaus, Oct 10 2010
KEYWORD
base,nonn
AUTHOR
Jonathan D. B. Hodgson, Oct 08 2010
STATUS
approved