The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A173580 Primes where each digit is represented by 0,1,2,4,or 8 0
 2, 11, 41, 101, 181, 211, 241, 281, 401, 421, 811, 821, 881, 1021, 1181, 1201, 1481, 1801, 1811, 2011, 2081, 2111, 2141, 2221, 2281, 2411, 2441, 2801, 4001, 4021, 4111, 4201, 4211, 4241, 4421, 4441, 4481, 4801, 8011, 8081, 8101, 8111, 8221, 8821, 10111 (list; graph; refs; listen; history; text; internal format)
 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. LINKS 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 See A066593 Cf. A066591, A066592. Sequence in context: A175447 A078746 A066593 * A062256 A024522 A144841 Adjacent sequences:  A173577 A173578 A173579 * A173581 A173582 A173583 KEYWORD nonn,base AUTHOR Michel Lagneau, Feb 22 2010 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 20 14:02 EST 2020. Contains 331094 sequences. (Running on oeis4.)