OFFSET
1,1
COMMENTS
It's possible to use the present sequence for messages coding by the choice of words code such as the Hamming distance (dH) is maximum, for example, with the code (12841,20101,41221,84011), dH = 8, but after error, the decoding with the maximum likelihood is alone insufficient. Then, we use the property of "prime number word-code" for improve the decoding.
MAPLE
with(numtheory): for n from 2 to 10000 do: l:=evalf(floor(ilog10(n))+1): n0:=n:indic:=0:for m from 1 to l do:q:=n0:u:=irem(q, 10):v:=iquo(q, 10): n0:=v : if u=3 or u= 5 or u= 6 or u=7 or u=9 then indic :=1 :else fi :od :if indic = 0 and type(n, prime) = true then print(n):else fi:od:
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Michel Lagneau, Feb 22 2010
STATUS
approved