|
%I #2 Mar 30 2012 18:35:51
%S 2,11,41,101,181,211,241,281,401,421,811,821,881,1021,1181,1201,1481,
%T 1801,1811,2011,2081,2111,2141,2221,2281,2411,2441,2801,4001,4021,
%U 4111,4201,4211,4241,4421,4441,4481,4801,8011,8081,8101,8111,8221,8821,10111
%N Primes where each digit is represented by 0,1,2,4,or 8
%C 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.
%p 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:
%Y See A066593 Cf. A066591, A066592.
%K nonn,base
%O 1,1
%A _Michel Lagneau_, Feb 22 2010
|
